Shell Sort — Sorting
🌟 What Is Shell Sort? Have you ever tried organizing a long line of people by height using Insertion Sort …
Data Structures
Insertion Sort(Sorting) — Data Structures
🌟 What Is Insertion Sort? Insertion Sort is a simple algorithm that builds the sorted list one element at a …
Heap Sort(Sorting) — Data Structurea
🌟 What Is Heap Sort? Heap Sort is a comparison-based sorting algorithm that uses a binary heap data structure.It works …
Binary Tree Sort — Sorting
🌟 What Is Binary Tree Sort? Binary Tree Sort is a sorting technique that uses a Binary Search Tree (BST) …
Selection Sort — Sorting
🌟 What Is Selection Sort? Selection Sort is a straightforward sorting algorithm that works by repeatedly finding the smallest element …
Quick Sort — Sorting
⚡ What Is Quick Sort? Quick Sort is a divide-and-conquer sorting algorithm.That means instead of sorting the whole list at …
Bubble Sort — Data Structures
💧 What Is Bubble Sort? Bubble Sort is a sorting algorithm that arranges elements (numbers, names, etc.) in ascending or …
Heap — Data Structures
🌱 What Is a Heap? A Heap is a special kind of binary tree that follows two important rules: So, …
Binary Search Trees — Data Structures
🌱 What Is a Binary Search Tree? A Binary Search Tree, or BST, is a special type of binary tree …
Representing Lists as Binary Trees — Data Structures
🌱 First, a Quick Reminder Before we talk about representing lists as binary trees, let’s quickly recall what each structure …