Scribd
Upload
56 views8 pages

Selection Sort: By-Abhishek Bhardwaj

Selection sort is an in-place comparison sorting algorithm that works by repeatedly finding the minimum element in the unsorted portion of the array and moving it to the beginning. It maintains two sub-arrays - a sorted sub-array and an unsorted sub-array. In each iteration, it selects the minimum element from the unsorted sub-array and swaps it with the element in the current position, sorting that portion of the array. The time complexity of selection sort is O(n^2) as it has two nested loops. While requiring no additional storage, it is not efficient for long lists.

Uploaded by

Abhishek Bhardwaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
56 views8 pages

Selection Sort: By-Abhishek Bhardwaj

Selection sort is an in-place comparison sorting algorithm that works by repeatedly finding the minimum element in the unsorted portion of the array and moving it to the beginning. It maintains two sub-arrays - a sorted sub-array and an unsorted sub-array. In each iteration, it selects the minimum element from the unsorted sub-array and swaps it with the element in the current position, sorting that portion of the array. The time complexity of selection sort is O(n^2) as it has two nested loops. While requiring no additional storage, it is not efficient for long lists.

Uploaded by

Abhishek Bhardwaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

SELECTION

SORT
BY- ABHISHEK BHARDWAJ
INTRODUCTION TO SELECTION SORT

• Selection sort is an in-place comparison-based sorting algorithm.


• The selection sort algorithm sorts an array by repeatedly finding the minimum element
(considering ascending order) from unsorted part and putting it at the beginning.
• The algorithm maintains two sub-arrays in a given array.
The sub-array which is already sorted. 
Remaining sub-array which is unsorted.
• In every iteration of selection sort, the minimum element (considering ascending order) from
the unsorted sub-array is picked and moved to the sorted sub-array. 
ALGORITHM OF SELECTION SORT

• Initialize minimum value(min) to location 0


• Traverse the array to find the minimum element in the array
• While traversing if any element smaller than min is found then
swap both the values.
• Then, increment min to point to next element
• Repeat until array is sorted
EXAMPLE
Lets consider the following array as an example: arr[] = {6,8,3,9,2}
First pass:
• For the first position in the sorted array, the whole array is traversed from index 0 to 4 sequentially. The
first position where 6 is stored presently, after traversing whole array it is clear that 2 is the lowest
value.
6 8 3 9 2
• Thus, replace 6 with 2. After one iteration 2, which happens to be the least value in the array, tends to
appear in the first position of the sorted list.

2 8 3 9 6
EXAMPLE (CONTINUED)
• Second Pass:
• For the second position, where 8 is present, again traverse the rest of the array in a sequential manner.
2 8 3 9 6

• After traversing, we found that 3 is the second lowest value in the array and it should appear at the second
place in the array, thus swap these values
2 3 8 9 6
• Third Pass:
• Now, for third place, where 8 is present again traverse the rest of the array and find the third least value
present in the array.
2 3 8 9 6

• While traversing, 6 came out to be the third least value and it should appear at the third place in the array,
thus swap 6 with element present at third position.
2 3 6 9 8
EXAMPLE (CONTINUED)
• Fourth pass:
• Similarly, for fourth position traverse the rest of the array and find the fourth least element in the array 
• As 8 is the 4th lowest value hence, it will place at the fourth position.

2 3 6 8 9

• Fifth Pass:
• At last the largest value present in the array automatically get placed at the last position in the array
• The resulted array is the sorted array.

2 3 6 8 9
SELECTION SORT: ANALYSIS
• COMPLEXITY
The time complexity of Selection Sort is O(N2) as there are two nested loops:
One loop to select an element of Array one by one = O(N)
Another loop to compare that element with every other Array element = O(N)
Therefore overall complexity = O(N)*O(N) = O(N*N) = O(N2)
• Is Selection Sort Algorithm stable?
Selection sort is an unstable algorithm.
ADVANTAGES & DISADVANTAGES OF
SELECTION SORT
Advantages
• The main advantage of selection sort is that it performs well on small lists.
• No additional temporary storage is required.
Disadvantages
• The primary disadvantage of selection sort is its poor efficiency while dealing
with long lists.
• The selection sort requires n-squared number of steps for sorting n number of
elements.

You might also like