DS Lab: Sorting & Selection Algorithms in Java | Bubble, Selection, Insertion, Merge & Quick Sort

📄 Welcome to the Data Structures Lab – Sorting & Selection Algorithms in Java! In this final lecture of the semester, we explore the fundamental sorting algorithms that every computer scientist must understand. You will learn how to implement Bubble, Selection, Insertion, Merge, and Quick Sort in Java, understand their time and space complexities, and solve selection problems like finding the k-th smallest element. ✔ Topics Covered in This Lecture 1. ntroduction to Sorting & Selection - Importance of sorting in programming and real-life applications - Stable vs. unstable algorithms - In-place vs. extra memory usage - Connection to arrays, recursion, and trees 2. Sorting Algorithms - Bubble Sort – Step-by-step swapping - Selection Sort – Finding minimum and swapping - Insertion Sort – Efficient for nearly sorted arrays - Merge Sort – Divide & conquer with recursion - Quick Sort – Partitioning and recursive sorting 3. Step-by-Step Demonstrations - Java implementation for all algorithms - Tracing examples and visual diagrams - Detailed explanation of recursion and partitioning 4. Student Activities - Implement all sorting algorithms in Java - Test on random, sorted, and reverse arrays - Count comparisons and swaps - Solve k-th smallest element problems 📌 GitHub – Full Code & Activities Repository link: https://github.com/Maryam-Skaik/java-ds-lab-sorting Contains: - Bubble, Selection, Insertion, Merge, and Quick Sort implementations - Selection (k-th smallest) examples - Tracing diagrams and step-by-step explanations - Post-lecture exercises 📘 This is the final lecture of the DS Lab series. Follow along in your IDE (NetBeans / VS Code / IntelliJ) and practice each algorithm to solidify your understanding. #Java #DataStructures #SortingAlgorithms #SelectionAlgorithms #BubbleSort #SelectionSort #InsertionSort #MergeSort #QuickSort #DSLab #JavaProgramming #AlgorithmAnalysis #Recursion #InPlaceSorting #StableSorting #MaryamSkaik #FinalLecture #ComputerScience #KthSmallest #Quickselect