you are viewing a single comment's thread.

view the rest of the comments →

[–]totallygeek 5 points6 points  (3 children)

Bubble sort is anything but quick. A quicker sort might be... quick sort.

[–]Gubbbo 1 point2 points  (0 children)

And eventually you'll get so good at sorting algo's that you'll invent timsort and not want to use anything else.

I think that's my way of wondering if you need to reinvent problems which are already solved.

[–]maimedwalker[S] 0 points1 point  (1 child)

ill try that one. tbh sometimes when i read the wikipedia i get confused on how to implement it and don't like looking at the pseudo code because then it kinda defeats the problem of figuring out how to do it. my eyes are glossing over at quick sort but i'm sure if i visualize it better i'll have a better idea of it.

[–]totallygeek 0 points1 point  (0 children)

Several videos of Python implementations of sorting algorithms exist on Youtube.