>> There are too many non-trivial algorithms that you are just likely to not rediscover.
> I agree, but would also (respectfully) ask, "So what?"
Well, if you're trying to sort big arrays with bubblesort, you may have to wait a long time...
> I agree, but would also (respectfully) ask, "So what?"
Well, if you're trying to sort big arrays with bubblesort, you may have to wait a long time...
>Teaching bubble sort as some kind of "basic sorting algorithm" has real-life negative consequences. This is a real-life example: this is a piece of code in the gnu flex program:
/* We sort the states in sns so we
* can compare it to oldsns quickly.
* We use bubble because there probably
* aren't very many states.
*/
bubble (sns, numstates);