NY State-Licensed Certificates in Design, Coding & AI — Online
Get 20% off all career paths from fullstack to AI
Overview
Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This introductory course teaches algorithmic problem solving and time and space complexity through Java implementations. Topics include searching, greedy and dynamic programming, minimum spanning trees, sorting, divide-and-conquer, backtracking, and recursion.
Syllabus
- What is an algorithm?.
- Algorithmic analysis.
- Linear search.
- Binary Search.
- Greedy Programming.
- Fractional Knapsack.
- Prim's minimal spanning tree.
- Quick Sort.
- Merge Sort.
- Backtracking.
- Recursion with Examples.
Taught by
Great Learning