Data Structures Tutorial

Data Structures Tutorial Asymptotic Notation Structure and Union Array Data Structure Linked list Data Structure Type of Linked list Advantages and Disadvantages of linked list Queue Data Structure Implementation of Queue Stack Data Structure Implementation of Stack Sorting Insertion sort Quick sort Selection sort Heap sort Merge sort Bucket sort Count sort Radix sort Shell sort Tree Traversal of the binary tree Binary search tree Graph Spanning tree Linear Search Binary Search Hashing Collision Resolution Techniques

Misc Topic:

Priority Queue in Data Structure Deque in Data Structure Difference Between Linear And Non Linear Data Structures Queue Operations In Data Structure About Data Structures Data Structures Algorithms Types of Data Structures Big O Notations Introduction to Arrays Introduction to 1D-Arrays Operations on 1D-Arrays Introduction to 2D-Arrays Operations on 2D-Arrays Strings in Data Structures String Operations Application of 2D array Bubble Sort Insertion Sort Sorting Algorithms What is DFS Algorithm What Is Graph Data Structure What is the difference between Tree and Graph What is the difference between DFS and BFS Bucket Sort Dijkstra’s vs Bellman-Ford Algorithm Linear Queue Data Structure in C Stack Using Array Stack Using Linked List Recursion in Fibonacci Stack vs Array What is Skewed Binary Tree Primitive Data Structure in C Dynamic memory allocation of structure in C Application of Stack in Data Structures Binary Tree in Data Structures Heap Data Structure Recursion - Factorial and Fibonacci What is B tree what is B+ tree Huffman tree in Data Structures Insertion Sort vs Bubble Sort Adding one to the number represented an array of digits Bitwise Operators and their Important Tricks Blowfish algorithm Bubble Sort vs Selection Sort Hashing and its Applications Heap Sort vs Merge Sort Insertion Sort vs Selection Sort Merge Conflicts and ways to handle them Difference between Stack and Queue AVL tree in data structure c++ Bubble sort algorithm using Javascript Buffer overflow attack with examples Find out the area between two concentric circles Lowest common ancestor in a binary search tree Number of visible boxes putting one inside another Program to calculate the area of the circumcircle of an equilateral triangle Red-black Tree in Data Structures Strictly binary tree in Data Structures 2-3 Trees and Basic Operations on them Asynchronous advantage actor-critic (A3C) Algorithm Bubble Sort vs Heap Sort Digital Search Tree in Data Structures Minimum Spanning Tree Permutation Sort or Bogo Sort Quick Sort vs Merge Sort

Sorting Algorithms

Sorting: In the data structure, sorting is the process by which you arrange the data in a logical order. This logical order can also be an ascending order or a descending order.

Sorting is related to searching. We search for many things in our life, such as a topic on google, a page in the book, a word in the dictionary, and roll number in the exam hall. Therefore, all these things that happen are sorted so that we can easily search them.

Types of sorting

There are two types of sorting in the data structure:

  1. Internal sorting
  2. External sorting

Internal sorting: The data to be sorted in this sorting resides in the main memory. There are the following types of internal sorting.

  1. Bubble sort
  2. Insertion sort
  3. Quick sort
  4. Heap sort
  5. Selection sort

External sorting: The data to be sorted in this sorting resides in secondary memory. There is so much data in this sorting that it cannot enter the main memory. There is only one type of external sorting called merge sort.

Bubble sort

Bubble sort is a very easy sorting technique. It compares all the elements one by one. It sorts them based on their values. In this, the two elements of the beginning are compared. If the first element is larger than the second element, it will change both elements' location, and this comparison will go on till the end.

Complexity table of bubble sort

ComplexityBest caseAverage caseWorst case
TimeO(n)O(n2)O(n2)
Space  O(1)

Algorithm of bubble sort

The following algorithm is used to implement a bubble sort.

Bubble_Sort(A)
Step 1: Repeat Step 2 and 3 for i = 1, 2….to n-1
Step 2: set j = 1
Step 3: Repeat while (j < n - i)              
{                
if (A[j] > A[j + 1])                 swap A[j] and A[j + 1]                 j = j + 1              
}
// end of while loop                  
// end of for loop    
Step 4: exit

For example: Let’s consider an array A{8. 14, 6, 7, 32, 15}.

  8 14 6 7 32 15  

First iteration
Step 1: Compare the first two elements, 8 < 14.             
No interchange
8 14 6 7 32 15  
Step 2: Compare the second and third elements, 14 > 6.            
The second element is larger than the third element, so it will swap the elements.       
8 6 14 7 32 15  
Step 3: Compare the third and fourth elements, 14 > 7.            
The third element is larger than the fourth element, so it will swap the elements.     
8 6 7 14 32 15  
Step 4: Compare the fourth and fifth elements, 14 < 32.             
No interchange  
8 6 14 7 32 15  
Step 5: Compare the fifth and sixth elements, 32 > 15.                                     
The fifth element is larger than the sixth element, so it will swap the elements.  
8 6 14 7 15 32                     
The first iteration is completed. Similarly, all iterations will be performed.  

Bubble sort program in C language.

#include<stdio.h>
 void main ()
   {      
 int i, j,temp;       
 int a[10] = {8, 7, 9, 1, 3, 2, 5, 10, 6, 4};        
for(i = 0; i<10; i++)       
{         
  for(j = i+1; j<10; j++) 
          {              
 if(a[j] > a[i])               
{                  
temp = a[i];                  
a[i] = a[j];                  
a[j] = temp;                 
}          
   }        
}   
printf("Bubble sort list\n"); 
  for(i = 0; i<10; i++) 
  {   printf("%d\n",a[i]);   }
        }    

Output:

Bubble sort list
1
2
3
4
5
6
7
8
9
10

Bubble sort program in java language

class BubbleSort
{            
void bubbleSort(int arr[])            
{                       
  int n = arr.length;                        
for (int i = 0; i < n-1; i++)                                   
  for (int j = 0; j < n-i-1; j++)                                                
if (arr[j] > arr[j+1])                                                
{          // swap arr[j+1] and arr[i]                  
  int temp = arr[j];                                                            
arr[j] = arr[j+1];                                                            
arr[j+1] = temp;                                                
}            
}               /* Prints the array */            
void printArray(int arr[])            
{                         int n = arr.length;                        
for (int i=0; i<n; ++i)                                   
System.out.print(arr[i] + " ");                      
   System.out.println();            
}               // Driver method to test above            
public static void main(String args[])            
{                        
BubbleSort ob = new BubbleSort();                        
int arr[] = {8, 7, 9, 1, 3, 2, 5, 10, 6, 4};                       
  ob.bubbleSort(arr);                  
       System.out.println("Bubble sort list");                       
  ob.printArray(arr);             } }  

Output:

Bubble sort list
1
2
3
4
5
6
7
8
9
10



ADVERTISEMENT
ADVERTISEMENT