Course Information
Registration period
Year-round Recruitment
Course Level
Study Mode
Duration
6 Hour(s) 35 Minute(s)
Language
English
Taught by
Shibaji Paul
Certificate
- Available
- *The delivery and distribution of the certificate are subject to the policies and arrangements of the course provider.
Rating
2 views
Course Overview
Learn Analysis of Algorithm using asymptotic notations like Big Oh and others. Understand and analyse sorting algorithms
This course will help to understand seven most important comparison based sorting algorithms along with the details of how to estimate the complexities for any algorithm. Students will clearly understand how to estimate the best case, average case and worst case complexities for any algorithm along with details analysis of each of the sorting algorithm.
The seven sorting algorithms that you will learn in this course are as follows:
Bubble sort
Selection Sort
Insertion Sort
Shell Sort
Quick Sort
Merge Sort
Heap Sort
Students will learn details of heap data structures along with the heap operations like, insertion into heap, heap adjust, heap delete and heapify while learning the heap sort.
Although, sorting utilities can be found in the library of any modern day programming language, however, it is must for a programming student to understand them from scratch as this will help to form strong foundation on algorithm. Also, it is often found that, many questions are asked on sorting algorithms on Job interviews, hence, it will be really fruitful to have a strong hold on this topic.
In the course, I described the logic of each of the seven comparison based sorting algorithms using visual description that is really easy to understand, then I explained the algorithm, analysed them for their performance and finally implemented them using C and Java.
If you are interested of implementing them using in other language you can also do that following the lectures. It will be really easy to do.
Course Content
- 9 section(s)
- 59 lecture(s)
- Section 1 Introduction
- Section 2 Efficiency of algorithm
- Section 3 Bubble Sort
- Section 4 Selection Sort
- Section 5 Insertion Sort
- Section 6 Shell Sort
- Section 7 Quick Sort
- Section 8 Merge Sort
- Section 9 Heap data structure and Heap sort
What You’ll Learn
- How to analyse an algorithm, understanding worst case, best case and average case complexities, Use Big O, Big Omega and Big Theta notations.
- Seven (7) important comparison based sorting algorithms, #Bubble Sort, #Selection Sort, #Insertion Sort, #Shell Sort, #Quick Sort, #Merge Sort and #Heap Sort.
- Students will get to know details of #heap data structures along with heap operations while leaning heap sort.
- They will experience and understand how to execute program on various input sizes and compare the execution time between different input sizes using graph.
Skills covered in this course
Reviews
-
AArchana subramanian
Author has designed the course very crisp and clear. This is the first ever course that I completed out of a big list of courses in Udemy. I have it in my reading list and would love to revisit again. Thanks for making it more interesting and easy to understand.
-
AAlexander Popov
As in all of Shibaji's courses the content is very useful and clear. Only one con I'd like to mention, sometimes he pays very detailed attention to simpler lessons but sometimes he just flies over more difficult parts without carefully going in details...
-
JJigar N. Patel
It is covering well, good course to gain knowledge and use it.
-
SSuraj Hodawadekar
It's always great learning experience with Shibaji sir because I like the teaching pace. No hurry in concept clearing methods all clean & nice. I bought both data structure & sorting algorithm course and both are well structured & well explained. Thank you sir for time and knowledge.
