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.
End-to-End Java Development Bootcamp
·
Module 4
Data Structures & Algorithms: Foundations
1
Big O Notation: Analyzing Algorithm Complexity
Analyze time and space complexity of algorithms using Big O notation.
2
Searching Algorithms: Linear and Binary Search
Implement linear search and binary search on an array.
Understanding and Implementing Recursion
Explain recursion and implement a simple recursive function (e.g., factorial).
4
Insertion Sort Implementation
Implement the insertion sort algorithm.
5
Implementing Merge Sort
Implement merge sort using a divide-and-conquer approach.
6
Sorting with Comparable and Comparator
Sort collections using Comparable and Comparator interfaces.
7
Two-Pointer Technique for Sorted Arrays
Solve problems using the two-pointer technique on sorted arrays.
Previous module
Essential Java APIs: Strings, Exceptions, and Collections
Next module
Data Structures & Algorithms: Interview Patterns