Anonymous user
Talk:Sorting algorithms/Bubble sort: Difference between revisions
Talk:Sorting algorithms/Bubble sort (view source)
Revision as of 15:42, 11 December 2008
, 15 years ago→This is bubble sort?: Optimized or un-optimized implementation.
(→This is bubble sort?: :D) |
(→This is bubble sort?: Optimized or un-optimized implementation.) |
||
Line 79:
::It could be done, but I suppose it is up to implementors; I've not done the C implementation, but if I had, I would have done it using the optimized "form", disregarding the ''expensive'' "form". --[[User:ShinTakezou|ShinTakezou]] 00:28, 11 December 2008 (UTC)
:::I don't know if it is necessary to have two implementations that has so little difference. In practice, the optimized version only requires decrementing the upper limit of the inner loop on each iteration and setting the initial value at the beginning. However, I notice both versions have been used in the implementations. So it might be good idea at least to mention on each implementation whether it uses optimized or un-optimized algorithm. --[[User:PauliKL|PauliKL]] 15:42, 11 December 2008 (UTC)
| |||