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
[ Best Case , Average Case , Worst Case ]
Analysis
**********
- The best case for bubble sort occurs when the list is already sorted or nearly sorted.
- Number of Comparisons for best case : 4 + 3 + 2 + 1 = 10
For array n= 5 => (n-1) + (n-2)+ …. + 2 + 1 = n(n-1)/2 = O(n2)
- The term best case performance is used to describe an algorithm's behavior under optimal conditions (i.e) for sorting, given inputs are sorted list.
- This is same for all other average and worst case analysis.
- Finally ,
Time Complexity for Selection Sort is the same for all cases worse case, best case or average case O(n2).
• The efficiency of Selection Sort does not
depend on the initial arrangement of the data.
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