Data Structure & Algorithms in Java for Intermediate Level

This module explains the importance of recursion in programming languages.

Recursion is a technique in which a function calls itself one or more times in its code. This module helps you understand recursion in detail.

Examples are the best way to understand any concept. Thus, this module consists of examples of recursion that will help you understand it better.

To learn and execute recursion, you must be thorough with the steps involved. This module addresses the steps involved in creating recursive functions.

This module has examples of recursion that explains termination condition, business logic, and the recursive call steps to help you understand recursion better.

This module explains what recursion is and how it works in the context of a tree.

It is essential to understand the internal mechanism of recursion as it is one of the significant concepts of programming languages. This module focuses on the internal mechanism of recursion and explains it with the help of a stack example.

This module contains solutions for the various recursion problems that address their time complexity. 

Tower of Hanoi is a mathematical puzzle or a game that will help you understand the stack and recursion concept. This module aims at familiarizing you with the recursion through the Tower of Hanoi concept.

This module helps you understand the Tower of Hanoi concept better by explaining the concept with the help of an example. 

Sorting algorithms are considered a significant part of programming. Before getting started with sorting algorithms, it is crucial to understand their need and this module focuses on addressing their importance.

This module familiarizes you with the various types of sorting algorithms present.

Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted. This module explains bubble sort and its algorithm in detail.

Quick sort is a sorting algorithm that uses a partitioning step to divide an array into subarrays, followed by a sorting step to sort the subarrays. This module explains the quick sort, time complexity, and algorithm with an example and demonstration.

A merge sort is a sorting algorithm that sorts items by dividing them into two groups, sorting each group, and then merging the groups back together. This module explains the merge sort, time complexity, and algorithm with an example and demonstration.

Insertion sort is a sorting algorithm in which each element is inserted into its correct position in a sorted array. This module explains insertion sort, time complexity, and algorithm with an example and demonstration.