Question 1 The sub a ay which is already sorted. Remaining sub a ay which is unsorted. In every iteration of selection sort, the minimum element from the unsorted sub a ay is picked and moved to the...

dd start-up wants to compete with Netflix (https://www.netflix.com/). It allows registered users to upload/download movie, write comments, rate the movie, etc. Users can view all comments and rating


Question 1 The sub a ay which is already sorted. Remaining sub a ay which is unsorted. In every iteration of selection sort, the minimum element from the unsorted sub a ay is picked and moved to the sorted sub a ay. Steps - Get a list of unsorted numbers. - Set a marker for the unsorted section at the front of the list. - Repeat steps until one number remains in the unsorted section. - Compare all unsorted numbers in order to select the smallest one. - Swap this number with the first number in the unsorted section. Pseudocode for above algorithm. for (i = 0 ; i { index = i; for(j = i+1 ; j { if(A[j]