Question: In given list of 0s, 1s and 2s, write a program to separate 0s, 1s and 2s. //Sorts a given list by selection sort //Input:

In given list of 0’s, 1’s and 2’s, write a program to separate 0’s, 1’s and 2’s.//Sorts a given list by selection sort //Input: An array A[0..n-1] of

//Sorts a given list by selection sort //Input: An array A[0..n-1] of orderable elements //Output: List A[0..n-1] sorted in ascending order Algorithm SelectionSort (A[0..n-1]) for i = 0 to n - 2 do min = i for j = i + 1 to n - 1 do if A[j] A[min] min = j swap A[i] and A [min]

Step by Step Solution

3.54 Rating (144 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

def dutchnati... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Data Structures Algorithms Questions!