SKILL BENCHMARK

# Python Data Structures Competency (Intermediate Level)

• 15m
• 15 questions
The Python Data Structures Competency (Intermediate Level) benchmark measures your knowledge of the workings of commonly used sorting algorithms and how their implementations affect output performance. You will be assessed on your skills in implementing common sorting algorithms and divide and conquer sorts. A learner who scores high on this benchmark demonstrates that they have the skills to perform sorting algorithms in Python.

## Topics covered

• apply Quicksort on an array of integers and analyze the results at each iteration to understand how the algorithm works
• code a function to implement the Insertion Sort algorithm
• code a function to implement the Merge Sort algorithm and test it on an array of integers
• describe how the Quicksort algorithm partitions and sorts a list of elements
• describe the process of sorting a list of elements using Merge Sort and list the complexity of this algorithm on various measures
• describe the steps involved in performing an Insertion Sort and compare it to the Bubble Sort
• identify the various properties of sorting algorithms that must be considered when selecting the right one for your data
• implement the Bubble Sort algorithm in Python
• invoke the Shell Sort algorithm on an array of integers and examine the output at each iteration to understand how it works
• outline the workings of the Shell Sort and recall the performance metrics of this divide and conquer algorithm
• recall the performance metrics of the Quicksort algorithm
• recall the performance of the Bubble Sort on various measures such as time, space, and number of swaps
• write the code to implement a Selection Sort
• write the code to implement the divide-and-conquer Shell Sort algorithm
• write the partition and Quicksort functions in order to implement a Quicksort