Skip to main content

Function to sort an array using bubble sort

Quick and dirty way of sorting an array is bubble sort. It is very easy to write and follow. But please keep in mind that it is not at all effecient.



#include<iostream>
using std::cin;
using std::cout;
void readArray(int arr[],int sz);
void printArray(int arr[],int sz);
void sortArray(int arr[],int sz);
void swap(int &a,int &b);

int main()
{
   int sz;
   cout<<"Size of the array=";
   cin>>sz;
   int arr[sz];
   readArray(arr,sz);
 
  sortArray(arr,sz);
  cout<<"Sorted array is ";
  printArray(arr,sz);
}

void readArray(int arr[],int sz)
{
 for(int i=0;i<sz;i++)
   {
      cout<<"arr["<<i<<"]=";
      cin>>arr[i];
  }
}
void printArray(int arr[],int sz)
{
 for(int i=0;i<sz;i++)
   {
      cout<<"arr["<<i<<"]=";
      cout<<arr[i]<<"\n";
  }
}
void sortArray(int arr[],int sz)
{
    for(int i=0;i<sz-1;i++)
   {
        for(int j=0;j<sz-i-1;j++)
        {
             if(arr[j]>arr[j+1])
                 swap(arr[j],arr[j+1]);
        }
   }
}
void swap(int &a,int &b)
{
    a = a+b;
    b = a-b;
    a = a-b;
}

This sorting compares and if necessary swaps the adjacent elements. Once all the elements are compared, it is one pass. Sorting requires such n-1 passes for an array of n elements. At each pass, the larger elements sink to the bottom and smaller elements bubble up to the top. Hence the name.
The complexity of bubble sort is O(n2)

You can make this slightly better by modifying the outer loop of sort function continue as long as there are any swappings.

void sortArray(int arr[],int sz)
{
    int swapped = 1;
    for(int i=0;i&lt && swapped==1;sz-1;i++)
   {
       swapped =0;//false
        for(int j=0;j<sz-i-1;j++)
        {
             if(arr[j]>arr[j+1])
                 {
                 swap(arr[j],arr[j+1]);
                  int swapped = 1;//set swapped to true
                  }
        }
   }
}
Labels:

Comments

Post a Comment

Popular posts from this blog

Delete a node from doubly linked list

Deletion operation in DLL is simpler when compared to SLL. Because we don't have to go in search of previous node of to-be-deleted node.  Here is how you delete a node Link previous node of node of to-be-deleted to next node. Link next node of node of to-be-deleted to previous node. Free the memory of node of to-be-deleted Simple, isn't it. The code can go like this. prevnode = delnode->prev; nextnode = delnode->next; prevnode->next = nextnode; nextnode->prev = prevnode; free(delnode); And that is it. The node delnode is deleted. But we should always consider boundary conditions. What happens if we are trying to delete the first node or last node? If first node is to be deleted, its previous node is NULL. Hence step 3 should not be used.  And also, once head is deleted, nextnode becomes head . Similarly if last node is to be deleted, nextnode is NULL. Hence step 4 is as strict NO NO. And we should set prevnode to tail. After we put these things together, we have...
Post a Comment
Read more

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more