Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Quicksort Best Case Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual proof for the best-case cost of Quicksort. | OpenDSA | Quicksort |
| 2 | Insertion Sort Best Case Slideshow | Code Tracing Presentation, Algorithm Analysis Presentation | Slideshow showing an analysis of Insertion Sort's best-case behavior and cost. | OpenDSA | Insertion Sort, Best Case |
| 3 | Bubble Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Bubble Sort's cost in worst, average, and best cases. | OpenDSA | Bubble Sort, Worst Case, Average Case, Best Case |
| 4 | Exchange Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Echange Sorting cost. | OpenDSA | Bubble Sort, Worst Case, Average Case, Best Case |
| 5 | Selection Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Selection Sort's cost analysis. | OpenDSA | Selection Sort, Worst Case, Average Case, Best Case |
| 6 | Best, Worst, and Average cases slideshow | Presentation | Slideshow illustrating analysis when there are different inputs of a given size. | OpenDSA | Problem, Algorithm, Program |
| 7 | Mergesort Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual analysis of Mergesort best, average, and worst case performance. | OpenDSA | Mergesort |
| 8 | Bubble Sort Best | Python CodeVisualization for demonstrating Bubble Sort Best | JSVEE | recursion, search algorithms, sorting, sorting algorithms | |
| 9 | Choosing the Best Indexing Method | Question, Battery | Self-test question battery on which is the best indexing choice for a given scenario. | OpenDSA | Tree-Based Indexing |
| 10 | Shellsort Performance Proficiency Exercise | Calculation Exercise | Interactive proficiency exercise for Shellsort that focuses on the best performing diminishing increments. User selects an increment series and is... | OpenDSA | Shellsort |
| 11 | Sort Comparison Summary Exercise | Question, Battery | Battery of self-assessment questions where user selects which sort is the best to use in a particular situation. | OpenDSA | Radix Sort |
| 12 | JSON Aggregate 2 | You're provided a list of laptops in JSON list format. Find the best laptop by minimizing the price and maximizing... | jsParsons | json, json-aggregate | |
| 13 | First Fit Memory Manager Visualization | Algorithm Visualization, User Supplied Data | Algorithm Visualization for various sequential memory manager schemes. User can select data for the visualization. Multiple versions are available: First... | OpenDSA | Sequential Fit Memory Manager |
| 14 | BST Delete Max Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive delete of the maximum value in a BST. | OpenDSA | Binary Search Tree |
| 15 | BST Insert Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive insert in a BST. | OpenDSA | Binary Search Tree |
| 16 | BST Remove Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive remove value in a BST. | OpenDSA | Binary Search Tree |
| 17 | BST Search Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive search in a BST. | OpenDSA | Binary Search Tree |
| 18 | Paged BST Slideshow | Algorithm Visualization | Slideshow showing the use of paging with a BST-based index. Updating the BST to require it to remain a complete... | OpenDSA | Tree-Based Indexing |
| 19 | Paged BST with Page Rebalancing For Use on Disk Slideshow | Algorithm Visualization | Slideshow showing the use of paging with a BST-based index. Reorganizing the nodes to be on optimal disk pages reduces... | OpenDSA | Tree-Based Indexing |
| 20 | Functional Programming Recursion: BST | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing list-of-list (tree) processing in a functional programming language: Binary Search Tree Search. | OpenDSA | Functional Programming |
| 21 | Inefficient Range Query in a BST Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing a range query implementation in a BST, contrasting an inefficient and an efficient implementation. | OpenDSA | Binary Search Tree |
| 22 | Binary Search Tree Insert Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST insert. | OpenDSA | Binary Search Tree |
| 23 | Binary Search Tree Remove Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST remove. | OpenDSA | Binary Search Tree |
| 24 | Binary Search Tree Search Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST search. | OpenDSA | Binary Search Tree |
| 25 | Tree Timeline Slideshow | Algorithm Visualization | Slideshow showing the concept of marking a timeline for the values stored in a BST. This will be contrasted with... | OpenDSA | Trie |
| 26 | Trie Timeline Slideshow | Algorithm Visualization | Slideshow showing the concept of marking a timeline for the values stored in a Trie decomposition version of a BST. | OpenDSA | Trie |