 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

In this course, Akanksha shall be discussing all sorting algorithms in detail. The course is narrated in Hindi and useful for GATE (CS and IT ) aspirants

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE & ESE

Hindi

(Hindi) Sorting Algorithms for GATE

Divide and Conquer

Algorithms

CS & IT

GATE - CSIT, DSAI & Placements

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Selection sort is a simple sorting algorithm where element belonging to the first position is selected and placed to that location ,then the second element is selected and so on

Selection Sort (in Hindi)

Bubble sort takes 2 elements at a time,compare them and swap if required

Bubble Sort (in Hindi)

Insertion sort is similar to sorting a deck of playing cards

Insertion Sort (in Hindi)

Merge Sort is based in divide and conquer technique.In this algorithm ,array is divided into 2 different arrays at every step and then the sorting is done in smaller arrays.

Merge Sort (in Hindi)

Heap Sort uses max heap for sorting the elements

Heap Sort (in Hindi)

Quick sort uses pivot element for sorting.After each recursive step pivot element is placed at it's correct location and all elements before pivot are smaller than pivot and all elements after pivot are greater than pivot element.

Quick Sort (in Hindi)

Counting sort and radix sort are not general purpose sorting algorithms.Counting sort uses count of distinct key values for sorting and radix sort does digit by digit sort using counting sort as a subroutine

Counting Sort and Radix Sort (in Hindi)

In this video, we have discussed some Previous Year Gate Questions on sorting Algorithms. Any course is incomplete without practising adequate amount of good quality questions. This is one of the most important video of this course.

Previous Year GATE Questions-Part 1(in Hindi)

In this video Previous Year Questions pf quick sort are discussed

Previous Year GATE Questions-Part 2(in Hindi)

In this video Previous Year GATE Questions are discussed on Quick Sort

Previous Year GATE Questions-Part 3 (in Hindi)

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Algorithm Designing Approaches With Problems and thier Solutions.

(Hindi) Greedy Algorithm Designing Approaches - GATE (CS & IT)

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

(Hindi) 100 Short Tricks to Learn Complexities of Algorithms - GATE (CS and IT)

IT Graduate | NITan. Teaching is my hobby and also a way to gain command over the subject by sharing knowledge with others.

Bhushan Mandal

In this course, the educator discusses the questions that were asked from the sorting section in gate previous years question paper.

(Punjabi) Sorting Algorithms - Previous Year Questions: GATE

In this course I am discussing previous years gate questions from sorting algorithms. This Course is beneficial for GATE (CS and IT) aspirants.

(Hindi) Sorting Algorithms Previous Years Questions : GATE (CS and IT)

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

Lessons

10 lessons • 1h 31m