DataStructures / Data structures Interview questions
Difference between Insertion Sort and Selection Sort.
Both insertion sort and selection sort have nested loops, one outer and inner loop.
In selection sort, the inner loop is over the unsorted elements. Each pass selects one element and moves it to its final location which is at the current end of the sorted region. In insertion sort, each pass of the inner loop iterates over the sorted elements. Sorted elements are displaced until the loop finds the correct place to insert the next unsorted element.
More Related questions...