This assignment gives us more practice with sorting algorithms.

We are reviewing and learning $6$ sorting algorithms. CSC $220$ covered Selection, Insertion, and Shell sorting algorithms. CSC $340$ covers Bubble, Merge, and Quick. Detailed instructions, illustrations, code, and samples are provided in class. Please refer to the "Sorting" package and the lecture slides posted on the File Manager.

More materials were organized and posted on the File Manager to assist us:

Assignments$/$Assignment$-04/$Assignment$-04\_$moreHelp

Let us aim to complete this assignment on time so that we will get it graded hopefully before our final exams. This material will be useful for our reviews.

This assignment is our last assignment for this semester. Congratulations and Thank you!

INSTRUCTION $-$ Sorting, $30$ points

Please come up with an array of $9$ random integers then sort the array in $3$ different ways. Show the contents of the array each time a sorting algorithm changes it while sorting the array into ascending order. The $3$ sorting algorithms we are using are:

Selection Sort

$10$ points

Insertion Sort

$10$ points

Shell Sort

$10$ points

OR $-$

Bubble Sort

$10$ points

Merge Sort

$10$ points

Quick Sort

$10$ points

It is OK to do this assignment on paper then organize the snapshots of your work in your assignment report. $($Adobe Scan, Google Lens, and Office Lens are good apps, which I know, for scanning documents. Please recommend yours. Thank you.$)$

Coding is highly recommended but not required. Please submit a single PDF file, the assignment report.