Scribd
Upload
14 views3 pages

Selection Sort Algorithm

Selection sort is a straightforward sorting algorithm that repeatedly selects the smallest element from the unsorted portion of a list and moves it to the sorted portion. The process involves traversing the array, swapping elements as necessary, until the entire list is sorted. An example is provided with an array, demonstrating how the algorithm sorts the elements through multiple passes.

Uploaded by

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

Selection Sort Algorithm

Selection sort is a straightforward sorting algorithm that repeatedly selects the smallest element from the unsorted portion of a list and moves it to the sorted portion. The process involves traversing the array, swapping elements as necessary, until the entire list is sorted. An example is provided with an array, demonstrating how the algorithm sorts the elements through multiple passes.

Uploaded by

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

Selection Sort Algorithm

Selection sort is a simple and efficient sorting algorithm that works by


repeatedly selecting the smallest (or largest) element from the unsorted
portion of the list and moving it to the sorted portion of the list.

The algorithm repeatedly selects the smallest (or largest) element from the unsorted
portion of the list and swaps it with the first element of the unsorted part. This process
is repeated for the remaining unsorted portion until the entire list is sorted.

Visualizing Selection Sort Algorithm

How does Selection Sort Algorithm work?

Lets consider the following array as an example: arr[] = {64, 25, 12, 22, 11}

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 64 is stored presently, after traversing
whole array it is clear that 11 is the lowest value.

Thus, replace 64 with 11. After one iteration 11, which happens to be the least value
in the array, tends to appear in the first position of the sorted list.

Selection Sort Algorithm | Swapping 1st element with the minimum in array

Second Pass:

For the second position, where 25 is present, again traverse the rest of the array in a
sequential manner.

After traversing, we found that 12 is the second lowest value in the array and it
should appear at the second place in the array, thus swap these values.

Page 1|3
Selection Sort Algorithm | swapping i=1 with the next minimum element

Third Pass:

Now, for third place, where 25 is present again traverse the rest of the array and
find the third least value present in the array.

While traversing, 22 came out to be the third least value and it should appear at the
third place in the array, thus swap 22 with element present at third position.

Selection Sort Algorithm | swapping i=2 with the next minimum element

Fourth pass:

Similarly, for fourth position traverse the rest of the array and find the fourth least
element in the array

As 25 is the 4th lowest value hence, it will place at the fourth position.

Page 2|3
Selection Sort Algorithm | swapping i=3 with the next minimum element

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.

Selection Sort Algorithm | Required sorted array

Page 3|3

You might also like