This project demonstrates algorithm design principles using search algorithms:
- Linear Search
- Binary Search
It includes documentation of Big-O time complexity and code comments.
βοΈ Clean Java OOP structure
βοΈ Algorithms separated into utility class
βοΈ Complexity analysis in comments
βοΈ Simple demonstration in main program
- Scans each element from left to right
- Works on unsorted data
- Time Complexity:
- Best: O(1)
- Worst: O(n)
- Space: O(1)
- Requires sorted input
- Repeatedly divides the search range
- Time Complexity:
- Best: O(1)
- Worst: O(log n)
- Space: O(1) iterative
javac SearchAlgorithms.java AlgorithmAnalysis.java
java AlgorithmAnalysis