Given an array contain 0’s and 1’s, sort the array such that all the 0’s come before 1’s.

Transcribed Image Text:

//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 Selection Sort (A[ 0..n-1]) for i = 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]