Video: .mp4 (1280×720, 30 fps(r)) | Audio: aac, 44100 Hz, 2ch | Size: 1.31 GB
Genre: eLearning Video | Duration: 14 lectures (3 hour, 38 mins) | Language: English
What you’ll learn
Analysis of Algorithms
4 sections • 14 lectures • 3h 38m total length
Desire to Learn
Welcome to the “Searching and Sorting Algorithms in C++” course.
Searching data is to find an element or the search key is present in the array or in a list. And there are 2 famous search algorithms that you will learn in this course. These are “Linear Search” and the more efficient algorithm “Binary Search”. Sorting data by using an algorithm can be analyzed as based on its adaptive or stable properties. Also number of comparisons and number of swaps are good indicators which tell us the efficiency of an algorithm. Some algorithms take constant time, quadratic time, some of them take linear time and some of them take logarithmic time. I will be using X-Code for demonstrations of the algorithms. But you can choose any IDE you want or any operating system.
Searching data involves determining whether a value is present in the data and, if so, finding the value’s location. Two popular search algorithms are the simple linear search and the faster but more complex binary search, which is introduced in this course. Sorting places data in ascending or descending order, based on one or more sort keys. A list of names could be sorted alphabetically, bank accounts could be sorted by account number, employee payroll records could be sorted by social security number, and so on. In this course we introduce the more efficient, but more complex merge sort. This course also introduces Big O notation, which is used to characterize an algorithm’s worst-case runtime—that is, how hard an algorithm may have to work to solve a problem.
In this course you will learn the subjects given below.
For each lesson, pdf version of code files are included in the resources section.
Who this course is for
Everyone who is interested in learning Sorting and Searching Algorithms