Computer Science Graduate, GATE Qualified, Philomath, Motivator, Singer, Actor, Loves Teaching

Ayushman Tiwari

Sorting Algorithms are important in context of GATE CS examination, Campus Placements and Semester exams. They are a must know and often confusing topics while studying Algorithms. This course will explain all these famous Algorithms in the best possible way by taking appropriate examples to explain their working procedure. Hope you like this course!

CBSE Class 12

English

Introduction to Sorting Algorithms for GATE Aspirants

GATE (Graduate Aptitude Test In Engineering) Preparation

Solutions

Physical Chemistry

Chemistry

Class 6-12

Become a topper in your school and ace your board exams by learning from best educators in the country

CBSE

CBSE (Central Board of Secondary Education)

Sorting Algorithms are one of the most important topics to be studied while studying Algorithms & are asked in technical written & Interviews as well as GATE examination. This lesson gives a brief overview of upcoming topics & introduces some basic terminologies. Hope you like this course. Spread this educational reform as much as possible :)

Introduction to the Course and Basic Terminologies

Asymptotic Notations are used to compare two non-negative functions on the basis of their growth rates. The three asymptotic Notations have been explained in this lesson. A brief introduction to Merge Sort Algorithm is being done. Developed by John Von Neumann in 1945, Merge Sort follows the Divide & Conquer technique to sort the unsorted list.

Asymptotic Notations, Introduction to Merge Sort Algorithm

Merge Algorithm is the heart & soul of Merge Sort Algorithm. This lesson explains it in the best possible way. An appropriate example has been taken to apply Merge Sort Algorithm practically. Also time & space complexity of Merge Sort have been explained.

Merge Algorithm, Time and Space Complexity of Merge Sort

Quick Sort Algorithm developed by Sir Tony George in 1970 is one of most widely used sorting algorithms. This lesson explain the entire working of Quick Sort Algorithm in absolute detail. Suitable example has been taken to explain the whole concept.

Quick Sort Algorithm

Quick Sort uses Partition Algorithm so firstly the analysis of Partition Algorithm is done. Time Complexity & Space Complexity of Quick Sort varies significantly comparing to Merge Sort in different cases. Quick Sort behaves worse when input is already sorted. The in-depth analysis is done in lesson for Worst, Best & Average Cases for both Time & Space Complexity.
Hope you are enjoying this course. Have an awesome day :)

Time and Space Complexity Analysis of Quick Sort

Inplace Sorting method don't need any significant extra space to carry out the sorting process like in Quick Sort, whereas Non-inplace sorting methods need extra space equal to input size to achieve sorting like in Merge Sort.
If relative order of similar elements is same in unsorted & sorted list, it is known as Stable Sorting. Merge Sort is stable whereas Quick Sort is not stable. 
Finally Comparison of Merge Sort & Quick Sort can be done on various parameters as described in lesson.
Congrats, you just finished the Merge Sort & Quick Sort :)

Extra Topics and Comparison between Merge Sort and Quick Sort

Bubble Sort is the most basic or elementary sorting algorithm. It has a simple logic to compare & exchange the adjacent algorithms. A suitable example has been taken to explain the entire logic & Time Complexity of Bubble Sort has been discussed.

Bubble Sort Algorithm

Selection Sort is one of the most popular sorting Algorithms. It works on logic that find the minimum element in every iteration & swap it. Also, it is a special case of Quick Sort where pivot element is minimum element in every case. Time Complexity Analysis & Algorithm have been explained very clearly in lesson.

Selection Sort Algorithm

Insertion Sort is one of the most popular sorting algorithms. It's algorithm is one of most challenging to understand but I have made it very easy for you to understand in this lesson. Also Time Complexity has been discussed. Insertion Sort performs way better than Selection & Insertion Sort and also is best suited algorithm for smaller inputs.
This brings us to the end of Sorting Algorithms, hope you enjoyed this course. :)
Follow me at - unacademy.com/user/Ayushman.Tiwari

Insertion Sort Algorithm

IIT/JEE/NEET-PHYSICS CHEMISTRY BIOLOGY EXPERT
10 YEARS TEACHING EXPERIENCE 


Mohd Rizwan Ullah

This Course covers 
Electrochemistry for Class 12.

(Hindi) Crash Course on Electrochemistry: Class 12

IITian at your door step (IITB)
 mentor, social influencer
Teaching Chemistry 
Experience : 10 plus years 
in most reputed institutes of Ind

Dhirpal 

This course covers fundamental concepts of atomic structure and sufficient problems from basic up to advanced level to help you crack all kind of problems from this topic in competitive examination

(Hindi) Bohr's Theory - Class 12

Graduated in Chemistry
Preparing for SSC/CGL.
Active Quora Writer.
Follow my profile for more CBSE / IIT-JEE courses.


Harsh Varshnay

In chemistry, a solution is a special type of homogeneous mixture composed of two or more substances. The term aqueous solution is when one of the solvents is water. In such a mixture, a solute is a substance dissolved in another substance, known as a solvent. The mixing process of a solution happens at a scale where the effects of chemical polarity are involved, resulting in interactions that are specific to salvation. The solution assumes the phase of the solvent when the solvent is the larger fraction of the mixture, as is commonly the case. The concentration of a solute in a solution is the mass of that solute expressed as a percentage of the mass of the whole solution.

(Hindi) Characteristics Of Solutions

Faculty in Chemistry with a teaching experience of 14 years. Specialised in teaching for boards and competitions.

Shaillee Kaushal

This course comprehensively covers unit 2 - 'Solutions' of Class 12 chemistry NCERT

Solutions - CBSE Class 12 Chemistry NCERT

This Course covers Solutions for Class 12.

(Hindi) Solutions : Class 12

Educator,Storyteller, 'Podcast'-(kahaniya)
M.Phil(Chemistry),LLB

Soma Agrawal

This course will help in covering the basics of the chapter Solid State of class 12 NCERT Chemistry text book

Lessons

9 lessons • 1h 36m

Invalid Date

NaN

Introduction to the Course and Basic Terminologies

Invalid Date

NaN

Asymptotic Notations, Introduction to Merge Sort Algorithm

Invalid Date

NaN

Merge Algorithm, Time and Space Complexity of Merge Sort

Invalid Date

NaN

Quick Sort Algorithm

Invalid Date

NaN

Time and Space Complexity Analysis of Quick Sort

Invalid Date

NaN

Extra Topics and Comparison between Merge Sort and Quick Sort

Invalid Date

NaN

Bubble Sort Algorithm

Invalid Date

NaN

Selection Sort Algorithm

Invalid Date

NaN

Insertion Sort Algorithm