6:26 Assignment Objectives Analyze the common sorting algorithms Selection Sort, Insertion Sort, Shell Sort, Bubble Sort, Quick Sort, Heap Sort, Tree Sort, Merge Sort and Radix Sort) including the proper application and technique employed by each Compare the characteristics of the data structures Linked List, Stack, Queue, Binary Search Tree, Priority Queue, Heap, and Hash Table, and use them in problem solving. Differentiate each of the STL data structure containers. Identify the characteristics and potential uses of recursion Implement in the high level programming language C++ the Linked List, Queue, Binary Search Tree Data Structures. Recognize a data structure and its relevance to computer science. OK such as simply stating "good job." Your feedback to other students is most helpful if you not only point out weak areas but also offer suggestions for improvement. The best feedback takes a three-stage approach to identify what was done well, weaknesses and areas for improvement Done