Java- Data Structures and Analysis
a) Pick one of the following sorting algorithms and discuss how it works, its main features including performance characteristics: Insertion Sort, Selection Sort, Bubble Sort, Heap Sort, Merge Sort, Quick Sort.
b) Consider an unsorted sequence sod eight different random positive integer numbers in the interval 1 .. 99. Trace the execution of the chosen sorting algorithm, in a step by step manner, to sort the sequence sin the increasing order.
Be sure to cite sources (if any) and comment on other students’ posts.
Note. The sorting process can be illustrated using a plain text editor, Word / PowerPoint.