Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Understand and apply algorithms
·
Module 6
Searching and Sorting Algorithms
1
Linear Search: Implementation and O(n) Complexity
Implement linear search and analyze its O(n) time complexity.
2
Binary Search: Implementation and Complexity Analysis
Implement binary search on a sorted list and analyze its O(log n) time complexity.
3
Insertion Sort: Algorithm and Complexity
Implement insertion sort and analyze its O(n²) time complexity.
4
Divide and Conquer Strategy
Explain the 'divide and conquer' strategy.
Merge Sort: A Divide and Conquer Approach
Implement merge sort, a recursive 'divide and conquer' algorithm.
6
Merge Sort: Analyzing O(n log n) Complexity
Analyze the O(n log n) time complexity of merge sort.
7
Sorting Algorithm Performance Analysis
Compare the performance trade-offs of different sorting algorithms.
Previous module
Recursion
Next module
Linear Data Structures