Searching and Sorting Techniques

This course will provide the basic knowledge & understanding of Searching & Sorting Algorithms. This course is for anyone who have heard the word algorithms and have no idea about it. This course is for absolute beginners.

In this course you will learn about what is algorithm and which are the different algorithm that can be used for performing task of searching and sorting.

The searching algorithms are used to search or find one or more element from a dataset. These type of algorithms are used to find elements from a specific data structures. Searching may be sequential or not. Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or a sub-structure of a given discrete structure.

A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure. Since sorting can often reduce the complexity of a problem, it is an important algorithm in Computer Science.

These algorithms have direct applications in searching algorithms, database algorithms, divide and conquer methods, data structure algorithms, and many more.