CSC 372 Spring 2020 Assignment: Sorting Algorithms Instructions 1) Insertion Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13 2) Selection Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13 3) Bubble Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13 6) Merge Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13 6) Quick Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13

Match the following. 1. show grouping of word processing tasks that can be performed quick access toolbar 2. shortcut location for commonly used elements scroll bars 3. organized commands used to modify documents ribbon 4. used to align and measure content in a word screen zoom bar 5. vertical and horizontal bars that are used to navigate through a document contextual tabs 6. displays the name of the document in use ruler 7. allows users to enlarge or shrink a visual of a word document title bar

Take a critical look at three gui applications you have used—for example, a spreadsheet, a word-processing program, and a game. describe how well each conforms to the gui design guidelines listed in this chapter.

Create a function (prob3_6) that will do the following: input a positive scalar integer x. if x is odd, multiply it by 3 and add 1. if the given x is even, divide it by 2. repeat this rule on the new value until you get 1, if ever. your program will output how many operations it had to perform to get to 1 and the largest number along the way. for example, start with the number 3: because 3 is odd, we multiply by 3 and add 1 giving us 10. 10 is even so we divide it by 2, giving us 5. 5 is odd so we multiply by 3 and add one, giving us 16. we divide 16 (even) by two giving 8. we divide 8 (even) by two giving 4. we divide 4 (even) by two giving 2. we divide 2 (even) by 2 to give us 1. once we have one, we stop. this example took seven operations to get to one. the largest number we had along the way was 16. every value of n that anyone has ever checked eventually leads to 1, but it is an open mathematical problem (known as the collatz conjectureopens in new tab) whether every value of n eventually leads to 1. your program should include a while loop and an if-statement.