Scribd
Upload
49 views

Selection Sort (With Code in Python-C++-Java-C)

1. Selection sort is an algorithm that selects the smallest element from an unsorted list and places it at the beginning of the list in each iteration. 2. It works by iterating through the list and finding the minimum element, swapping it with the first unsorted element. 3. The time and space complexity of selection sort is O(n^2) and O(1) respectively, making it less efficient for large data sets than other algorithms like quicksort.

Uploaded by

Thee Kullatee
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Selection Sort (With Code in Python-C++-Java-C)

1. Selection sort is an algorithm that selects the smallest element from an unsorted list and places it at the beginning of the list in each iteration. 2. It works by iterating through the list and finding the minimum element, swapping it with the first unsorted element. 3. The time and space complexity of selection sort is O(n^2) and O(1) respectively, making it less efficient for large data sets than other algorithms like quicksort.

Uploaded by

Thee Kullatee
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Thank you for printing our content at www.domain-name.com.

Please check back soon for

Try hands-on Interview (h!ps://programiz.pro/course/python-interview-q


CODING utm_source=programiz-top-
Preparation with
PRO bar&utm_campaign=programiz&utm_medium=re
Programiz PRO
36% OFF
Claim Discount Now

Search tutorials & examples


(/)
www.domain-name.com

Selection Sort Algorithm


In this tutorial, you will learn about the selection sort algorithm and its
implementation in Python, Java, C, and C++.

Selection sort is a sorting algorithm


(h!ps://www.programiz.com/dsa/sorting-algorithm) that selects the
smallest element from an unsorted list in each iteration and places that
element at the beginning of the unsorted list.

Working of Selection Sort


1. Set the first element as minimum .
Select first element as minimum

2. Compare minimum with the second element. If the second element is


smaller than minimum , assign the second element as minimum .

Compare minimum with the third element. Again, if the third element is
smaller, then assign minimum to the third element otherwise do
nothing. The process goes on until the last element.

Compare minimum with the remaining elements

3. A%er each iteration, minimum is placed in the front of the unsorted list.
Swap the first with minimum

4. For each iteration, indexing starts from the first unsorted element. Step
1 to 3 are repeated until all the elements are placed at their correct
positions.

The first iteration


The second iteration

The third iteration


The fourth iteration

Selection Sort Algorithm

selectionSort(array, size)
repeat (size - 1) times
set the first unsorted element as the minimum
for each of the unsorted elements
if element < currentMinimum
set element as new minimum
swap minimum with first unsorted position
end selectionSort

Selection Sort Code in Python, Java, and C/C++

Python Java C C++


:
# Selection sort in Python

def selectionSort(array, size):

for step in range(size):


min_idx = step

for i in range(step + 1, size):

# to sort in descending order, change > to < in this line


# select the minimum element in each loop
if array[i] < array[min_idx]:
min_idx = i

# put min at the correct position


(array[step], array[min_idx]) = (array[min_idx], array[step])

data = [-2, 45, 0, 11, -9]


size = len(data)
selectionSort(data, size)
print('Sorted Array in Ascending Order:')
print(data)

Selection Sort Complexity

Time Complexity  

Best O(n2)

Worst O(n2)

Average O(n2)

Space Complexity O(1)


:
Stability No

Cycle Number of Comparison

1st (n-1)

2nd (n-2)

3rd (n-3)

... ...

last 1

Number of comparisons:
(n - 1) + (n - 2) + (n - 3) + ..... + 1 = n(n - 1) / 2 nearly equals to
n2 .

Complexity = O(n2)

Also, we can analyze the complexity by simply observing the number of


loops. There are 2 loops so the complexity is n*n = n2 .

Time Complexities:

Worst Case Complexity: O(n2)

If we want to sort in ascending order and the array is in descending


order then, the worst case occurs.

Best Case Complexity: O(n2)

It occurs when the array is already sorted

Average Case Complexity: O(n2)


:
It occurs when the elements of the array are in jumbled order (neither
ascending nor descending).

The time complexity of the selection sort is the same in all cases. At every
step, you have to find the minimum element and put it in the right place.
The minimum element is not known until the end of the array is not
reached.

Space Complexity:

Space complexity is O(1) because an extra variable temp is used.

Selection Sort Applications


The selection sort is used when

a small list is to be sorted

cost of swapping does not ma"er

checking of all the elements is compulsory


:
cost of writing to a memory ma"ers like in flash memory (number of
writes/swaps is O(n) as compared to O(n2) of bubble sort)

Similar Sorting Algorithms


1. Bubble Sort (/dsa/bubble-sort)

2. Quicksort (/dsa/quick-sort)

3. Insertion Sort (/dsa/insertion-sort)

4. Merge Sort (/dsa/merge-sort)

Previous Next Tutorial:


Tutorial:
(/dsa/bubble- (/dsa/insertion-
Insertion
sort) sort)
Bubble Sort
Sort

Share on:
(h"ps://www.facebook.com/sharer/sharer.php? (h"ps://twi"er.com/intent/twe
u=h"ps://www.programiz.com/dsa/selection- text=Check%20this%20amazi
sort) sort)

Did you find this article helpful?


:
Related Tutorials

DS & Algorithms DS & Algorithms

Insertion Sort Algorithm Bubble Sort

(/dsa/insertion-sort) (/dsa/bubble-sort)

DS & Algorithms DS & Algorithms

Shell Sort Algorithm Quicksort Algorithm

(/dsa/shell-sort) (/dsa/quick-sort)
:

You might also like