Visual Demonstration of Bubble Sort Algorithm

Bubble sort is easiest sorting in Data Structure ( from programming point of View ),

Why this sorting called Bubble sorting ?
In this sorting method, Greatest element is comes at last index of List and all least elements comes up in each pass Like BUBBLE. bubble comes up from bottom and heavy weight goes down.

in below Video Tutorial Following topics are explained :

• Algorithm of Bubble sort
• Visual Demonstration of Bubble sort
• Time complexity of this sorting 

Source :  http://www.youtube.com/watch?v=P00xJgWzz2c

Visual Demonstration of the QuickSort Algorithm

Quick sort is fastest sorting in Data structure. Algorithm is little bit difficult to understand by reading it.
Learning  Fundamental of every concept is best rather than only remember algorithm line by line, This  video tutorial teaches you basic funda of doing Quick Sort.

Everyone learns faster by seeing Visual Demonstration and this Demonstration allows you to do same. 

Data Structure Quick Sort

Data Structure Quick Sort and Algorithms by  

Dr. Naveen Garg,
Department of Computer Science and Engineering ,IIT Delhi.

Sub Topics covered:

• Quick sort Algorithm
• Linear time partitioning procedure
• analysis quick sort procedure
• best case
• worst case
• average scenario
• randomized quick sort
  

For more details on NPTEL visit http://nptel.iitm.ac.in

Introduction to Data Sructure and Algorithms

introduction to data sructure and algorithms by

 Dr. Naveen Garg

Sub Topics covered

• Algo. problems and solution
• what is good algo?
• measuring the running time
• pseudo code
• algo. analysis
• Insertion sort
• asymptotic notation

For more details on NPTEL visit http://nptel.iitm.ac.in