Sorting Algorithms using Java & C: Make Your Basics Strong

Learn Analysis of Algorithm using asymptotic notations like Big Oh and others. Understand and analyse sorting algorithms

Created by: Shibaji Paul
Programming Instructor with 16+ years of experience

What Will I 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.

Requirements

• Students must be familiar with basic understanding of C or Java. If you are familiar with any other language then also you can join the course, however, the implementations of the sorting algorithms in this course is done in both C and Java only.

Target audience

• "Sorting algorithms" are gateway to the world of understanding algorithms, any programming aspirant who wants to make the fundamentals more concrete. The fact is, in Job interviews of many questions are asked from this section.