Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Count visits in selection sort | Code Completion | In section 14.5, we approximated a count of the array visits in merge sort. Your task is to provide an... | CodeCheck | Sorting and Searching |
| 2 | Count visits in selection sort | Code Completion | In section 14.3, we approximated a count of the array visits in selection sort. Your task is to provide an... | CodeCheck | Sorting and Searching |
| 3 | Selection sort modification placing only min and max | Code Completion | Your task is to modify the selection sort algorithm so that you find the largest element and swap it to... | CodeCheck | Sorting and Searching |
| 4 | Selection sort modification, placing the largest element first | Code Completion | Your task is to modify the selection sort algorithm so that you find the largest element and swap it to... | CodeCheck | Sorting and Searching |
| 5 | Descending merge sort | Code Completion | CodeCheck | Sorting and Searching | |
| 6 | Selection sort modification placing even before odd | Code Completion | Implement a modification of the SelectionSorter class that reorders the array to have even elements followed by odd ones. Follow... | CodeCheck | Sorting and Searching |
| 7 | Modified SelectionSort | Code Completion | Your task is to modify the selection sort algorithm so that you find the largest element and swap it to... | CodeCheck | Sorting and Searching |
| 8 | Sort real data | Code Completion | Your task is to sort an array list of path names such as | CodeCheck | Sorting and Searching |
| 9 | Number guesser | Code Completion | Your task is to implement a number guesser that works on the principle of a binary search. In each step,... | CodeCheck | Sorting and Searching |
| 10 | Merge sort modification placing even before odd | Code Completion | Modify the merge sort algorithm so that, instead of sorting an array, it rearranges places all even elements before the... | CodeCheck | Sorting and Searching |
| 11 | Insertion Sort | Insertion sort works similarly to how one would sort a hand of cards: by choosing an element and searching through... | PCEX | recursion, search algorithms, sorting, sorting algorithms | |
| 12 | Recursive Binary Search | Construct a function that uses recursive binary search to find if a specific value is in a list (known as... | PCEX | recursion, search, search algorithms, sorting | |
| 13 | Practicing searching the index of the min and max elements | Construct a program that finds the indexes of both the max and min elements in a list. num_list is a... | jsParsons | algorithm analysis, recursion, search algorithms, sorting algorithms |