01:198:111 Lecture Notes - Lecture 5: Insertion Sort, Selection Sort, Substring

• School: Rutgers University
• Department: Computer Science
• Course: 01:198:111
• Professor: A Centeno

Document Summary

List the resulting array after each iteration of the selection sort algorithm. Sort the following array of letters (sort into. Original: [c q s a x b t] [a | c q s x b t] [a b | c q s x t] [a b c | q s x t] [a b c q | s x t] [a b c q s | x t] [a b c q s t | x] Final sorted array: [a b c q s t x] alphabetical order): 21 total comparisons: list the resulting array after each iteration of the insertion sort algorithm. Indicate the number of letter-to-letter comparisons made for each iteration. Sort the following array of letters (sort into alphabetical order): Given: [c | q s a x b t] [ c q | s a x b t] [c q s | a x b t] [a c q s | x b t]