What You Will Learn!
- Students will get the Deep knowledge and analysis on Sorting techniques with respective programs executed.
- Students will find the difference among different sorting techniques.
- They will observe which sorting is best in particular situation of inputs.
- At the i explained Space and time complexities of each sorting technique enclosed as a table.
Description
The Course covers the following sorting techniques and Each Sorting Technique includes step by step explanation with example , Program written in C- Language followed by successful execution and the complexity of the sorting technique in best , average and worst case scenario.
1. Selection sort
a.Selection sort example
b. C-Program with and without a seperate function and execution
c.How to sort only first half of elements.
d. How to sort only second half of elements.
e. Arranging first half in ascending and second half in descending order.
f. Complexity of Selection sort.
2. Bubble sort
a. Bubble sort example
b. C-Program with and without a seperate function and execution
c.How to sort only first half of elements.
d. How to sort only second half of elements.
e. Arranging first half in ascending and second half in descending order.
f. Complexity of Bubble sort.
3. Insertion sort
a.Bubble sort example
b. C-Program with(2) and without(1) a seperate function and execution .
c. Complexity of Insertion sort.
4. Merge sort
a. Merge sort example.
b. C-Program and execution .
c. Complexity of Merge sort.
5. Quick sort
a. Quick sort example .
b. C-Program and execution .
c. Complexity of Quick sort in worst case with an example.
6. Heap sort
a.What is complete binary tree.
b. Creation of Heap tree (MAX heap).
c. Heapsort Procedure
d. Program and execution
e. Complexity of Heapsort.
7. Counting sort
a. Clear explanation with example.
b. Program and execution
e. Complexity of Counting sort.
8. Radix sort
a. Clear explanation with example.
b. Program and execution
e. Complexity of Radix sort.
9.Bucket sort
a. Clear explanation with example.
b. Program and execution
e. Complexity of Radix sort.
10.Sorting strings in Dictionary order (Program and execution)
11.Comparison and Discussion of all the above.
Thank you.
Who Should Attend!
- Candidates who are preparing for technical interviews and Company placements.
- Candidates who are preparing for All India GATE competetion.
- Candidates who want to get thorough knowledge in sorting techniques.
