Overview
This course on Algorithms in Java aims to teach learners the fundamentals of algorithms and algorithmic analysis, focusing on time and space complexity calculations. The course covers various programming paradigms such as greedy programming, dynamic programming, and Divide & Conquer, with practical implementations discussed alongside theoretical concepts. By the end of the course, students will have gained skills in implementing algorithms in Java, understanding algorithmic analysis, and applying different programming paradigms. The teaching method includes theoretical explanations, practical examples, and code implementations. This course is intended for individuals interested in enhancing their algorithmic problem-solving skills using Java programming.
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