Recursion on Arrays | Linear Search, Binary Search & Indices | Recursion Lecture 2

Lecture Resources https://github.com/Tiwarishashwat/Java-Plus-DSA-Placement-Course/tree/main/Lecture-096%20-%20Recursion%20on%20Arrays Welcome to Lecture 2 of the Recursion Series, where we apply recursion to one of the most important DSA structures — arrays. In this lecture, you’ll learn how recursion works when combined with index movement, and how to return values, indices, and even lists from recursive calls. What you will learn in this video: How recursion works on arrays using index-based logic Printing array elements recursively Recursive Linear Search Finding first occurrence of an element Finding last occurrence (checking while returning) Returning all indices of an element using recursion Recursive Binary Search (sorted array) Dry runs & recursion flow visualization Time & Space Complexity patterns for array recursion Common mistakes beginners make This lecture builds the foundation for: Divide & Conquer algorithms Sorting algorithms (Merge Sort, Quick Sort) Backtracking Advanced recursion problems This video is part of my Java + DSA course by ShashCode, designed for: DSA beginners College students Placement & interview preparation Mastering recursion-based thinking 👉 Watch till the end to get complete clarity on recursion with arrays. Timestamp: 0:00 - Introduction 3:11 - Print array left to right using recursion 6:15 - Print array right to left using recursion 8:49 - Check if target is present in array or not 13:40 - Find first occurrence of element 17:40 - Find last occurrence of element 24:19 - Find Index 32:06 - Homework 32:46 - Binary Search using Recursion 40:09 - Outro