problem solving with c ( selection sort )

u Vodafone EG 11:46 AM 31% e Zoom Leave X Stat Portal - Intro to Problem Solving: 12 x Side x T aast.edu/pluginfile.php/422927/mod_resource/content/2/0C213-Week03-Searching%20%20Sorting pot tx Google Finance St. Stockhouse - Small CCSE Home Start Akady bubble insertion sort Selection Sort Find the smallest element in an array and change its position with the first element . Find the second smallest element in that array and change its position with the second element. . Continue until the last element is reached . This method is called Selection Sort, because every time the smallest remaining element is selected. Assume elements to be in locations 0..n-1 Let (1) be the start of a sub-array of at least 2 elements, i.e. i = 0...n-2 . for each i = 0 .. n-2 find smallest element in sub-array a[i..n-1] ENQ- T Unmute Start Video Share Screen Participants More