?? Day 26 with Data Structures and Algorithms (DSA): Recursion Problems??

On this 26th day of engaging with data structures and algorithms, I delved into problem-solving using recursion.

1.Reverse Array :

2. Check Palindrome :

3. Power of n :

4. Selection Sort Using Resursion :

Selection Sort : Selection Sort is another simple sorting algorithm that sorts an array by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning. The algorithm divides the input list into two parts: the sorted and the unsorted sublists. In each iteration, it finds the minimum element from the unsorted sublist and swaps it with the first element of the unsorted sublist.

5. Bubble Sort Using Resursion :

Bubbble Sort : Bubble Sort is a basic sorting algorithm that repeatedly steps through a list, compares adjacent elements, and swaps them if they are in the wrong order. The process is repeated until the entire list is sorted. It is named "Bubble Sort" because smaller elements gradually "bubble" to the top of the list. While simple to understand and implement, Bubble Sort is not very efficient for large datasets, having a time complexity of O(n^2).

In this I solved quesrion using recursion .If you get any Error in this Please let me know .