A simple sorting technique that scans the sorted list, starting at the beginning, for the correct insertion point for each of the items from the unsorted list… Read more »
Analysis
Selection Sort Analysis
- The number of comparison between elements and the number of exchange between elements determine the efficiency of Selection Sort algorithm.
For an array with size n, the external loop will iterate from n- 1 to 1.
for (int last = n-1; last>=1; --last)
• For each iteration, to find the largest number in subarray,
the number of comparison inside the internal loop must is
equal to the value of last.
for (int p=1;p <=last; ++p)
• Therefore the total comparison for Selection Sort in each
iteration is
(n-1) + (n-2) + ….. 2 + 1.
• Generally, the number of comparisons between elements in
Selection Sort can be stated as follows:
Sorting by MS.K.Abirami
-
BUBBLE SORT
Bubble sort is a sorting algorithm that works by repeatedly stepping through lists that need to be sorted, comparing each pair of adjacent items and swapping them ...Read more »
-
INSERTION SORT
SELECTION SORT
It starts by comparing the entire list for the lowest item and moves it to the #1 position. It then compares the rest of the list for the next-lowest item....Read more »
QUICK SORT
A sorting technique that sequences a list by continuously dividing the list into two parts and moving the lower items to one side and the higher items to the other. … Read more »
BUBBLE SORT
The number of comparison between elements and the number of exchange between elements determine the efficiency of Bubble Sort algorithm.Read more »
Insertion SORT
Insertion sort is also a time taking technique as its complexity is O(n2)Read more »
selection SORT
The number of comparison between elements and the number of exchange between elements determine the efficiency of Bubble Sort algorithm.Read more »
quick SORT
The efficeieny of the quicksort depends on the pivot element. However the pivot element can also be choosen at random order or from the last element of the array