Welcome to the Algorithm Basic Searching and Sorting Algorithms repository! This repository contains comprehensive coverage of basic searching algorithms, sorting methods, and advanced tree-based algorithms. With step-by-step implementations in C# and in-depth explanations, this course aims to solidify your understanding of fundamental algorithms.
- Basic Searching Algorithms
- Linear Search
- Binary Search
- Simple Sorts
- Bubble Sort
- Selection Sort
- Insertion Sort
- Tree Traversal Algorithms
- Pre-order, In-order, Post-order Traversal
- Level-order Traversal (BFS)
- Binary Search Tree (BST)
- Balanced Tree - AVL Tree
- Balanced Trees - Red-Black Tree
- Duration: 5:43
- Learn the simple and intuitive linear search algorithm.
- Includes: C# Implementation (4:28)
- Duration: 21:24
- Explore the efficient binary search algorithm, which divides the search space in half with each step.
- Includes: Binary Search Implementation in C# (11:26)
- Duration: 11:58
- Understand the bubble sort algorithm, which repeatedly swaps adjacent elements to sort the array.
- Implementation included in C#.
- Duration: 11:24
- Study the selection sort algorithm, which selects the smallest element in each iteration and places it in the correct position.
- Implementation included in C#.
- Duration: 7:46
- Learn how insertion sort builds the sorted array one item at a time.
- Implementation included in C#.
- Learn the core tree traversal methods used in binary trees for different applications.
- Duration: 7:35
- Dive into the Level-order Traversal (BFS) algorithm and its practical applications in tree traversal.
- C# Implementation included (9:08).
- Duration: 19:47
- Explore the concept of Binary Search Trees, a fundamental data structure for searching operations.
- BST Creation and Implementation in C# with examples.
- Duration: 13:41
- Discover the limitations of Binary Search Trees, especially in cases where the tree becomes unbalanced.
- Duration: 18:11
- Learn about the AVL Tree, a self-balancing binary search tree.
- Explore different types of rotations such as Right Rotation (RR), Left Rotation (LL), Left-Right (LR), and Right-Left (RL) to maintain tree balance.
- Learn how to insert, delete, and search in an AVL Tree.
- AVL Tree Implementation in C# with complete explanations.
- Using AVL Trees for real-life applications like Autocomplete.
- Duration: 22:47
- Study Red-Black Trees, a balanced binary search tree with special properties to ensure efficient search operations.
- Insertions and Deletions in Red-Black Trees are covered along with methods to handle tree balancing violations.
- Compare AVL Trees and Red-Black Trees to understand their strengths and weaknesses in different scenarios.
- C# installed on your machine.
- A development environment like Visual Studio or Visual Studio Code.
- Clone this repository to your local machine:
git clone https://github.com/your-username/algorithms-basic-searching-sorting.git