Lab 20: Comparison-Based Sorts | CS 61BL Summer 2024
Each assignment will have an FAQ linked at the top. You can also access it by adding “/faq” to the end of the URL. The FAQ for Lab 20 is located here. As usual, pull the files from the skeleton and make a new IntelliJ project. In today’s lab, we’ll be discussing sorting, algorithms for rearranging elements in a collection to be in a specific order. There are many problems you can more easily solve with a sorted collection, including performing binary search in 𝑂 ( log 𝑁 ) time, efficiently identifying adjacent pairs within a list, finding the 𝑘 𝑡 ℎ largest element, and so forth. There are several kinds of sorting algorithms, each of which is appropriate for different situations. At the highest level, we will distinguish between two types of sorting algorithms: In this lab and the following lab, we will discuss several comparison-based sorts including insertion sort, selection sort, heap sort, merge sort and quick sort. Why all the different sorts? Each sort has a different se
Each assignment will have an FAQ linked at the top. You can also access it by adding “/faq” to the end of the URL. The FAQ for Lab 20 is located here. As usual, pull the files from the skeleton and make a new IntelliJ project. In today’s lab, we’ll be discussing sorting, algorithms for rearranging elements in a collection to be in a specific order. There are many problems you can more easily solve with a sorted collection, including performing binary search in 𝑂 ( log 𝑁 ) time, efficiently identifying adjacent pairs within a list, finding the 𝑘 𝑡 ℎ largest element, and so forth. Ther
Explore this link on the map →