Visualize Searching and Sorting Algorithms and Implement them in C++

Description

Hey there! In this course on searching and sorting algorithms. We will be visualising the workflow of the algorithms and understanding the hang of them. We will implement what we have understood in Cpp Programming. We will compare and contrast each algorithm in terms of time, space, adaptability and stability.

The searching algorithms that we will be studying in this course are

1. Linear Search

2. Binary Search – Both Recursive and Iterative

3. Jump Search.

The sorting algorithms what we will be looking in this course are:

1. Bubble Sort

2. Selection Sort

3. Merge Sort

4. Quick Sort

5. Count Sort

6. Bucket Sort

7. Radix Sort

8. Insertion Sort

You’ll be able to understand the typical use cases, workflow, time complexity, implementation of each and every algorithm.

Follow Our Pages for Instant New Free Course Notifications!

LinkedIn YouTube Facebook Instagram Twitter Telegram

A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most frequently used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output. More formally, the output of any sorting algorithm must satisfy two conditions:

  1. The output is in nondecreasing order (each element is no smaller than the previous element according to the desired total order);
  2. The output is a permutation (a reordering, yet retaining all of the original elements) of the input.

For optimum efficiency, the input data in fast memory should be stored in a data structure which allows random access rather than one that allows only sequential access

English

Language

Content

Introduction

Introduction

Linear Search

2. Linear Search – Explanation

3. Linear Search – Code

Binary Search

4. Binary Search – Explanation

5.Iterative Implementation of Binary Search

6.Recursive Implementation of Binary Search

Jump Search

6.1 Jump Search

6.2 Jump Search Implementation


Subscribe to latest coupons on our Telegram channel.

Bubble Sort

7. Example 1 – Bubble Sort

8.Example 2 – Bubble Sort

9.Implementation of Bubble Sort

Selection Sort

10. Selection Sort – Explanation

11. Code – Selection Sort in C++

Count Sort

12. Count Sort – Explanation

13.Count Sort Code in C++

Bucket Sort

14. Bucket Sort – Explanation

15. Implementation of Bucket Sort – I

16. Implementatio of Bucket Sort – II.

Radix Sort

17. Radix Sort – Explanation

18. Radix Sort – Continued

19.Implementation of Radix Sort in C++

Insertion Sort

20. Inserting an element into a sorted array

21. Insertion Sort – Explanation

22. Insertion Sort – Code

Quick Sort

23. QuickSort – Easy Explanation

Quick Sort – Example 2

Quick Sort – Code

Merge Sort

Merge Sort

Repository for the Source Codes!

Get all the source codes here!