Programmers. Is is insertion sort faster than selection?

[SnoopCat]

?

 

[Haircut]

Bubble sort is the fastest

 

[Monza]

The algorithm for selection i faster than insertion sort. But if you want the fastes way you would look at QuickSort and QuickSelect.

inerstionsort is O(N^2) ond
quicksort is O(NlogN)

its very faster on fields that is quite high.

 

[hans007]

man , i should know the answer to this. oddly i remember all the algorithms but not the names for them. bubble is usually faster.