Bubble Sort C++

/*
*bubblesort.cpp
*
* Created on: May 28, 2017
* Author: asharda
*/

#include<iostream>
using namespace std;

void bubblesort(int arr[],int size)
{
int temp;

for (int i=0;i<size;i++)
{
for (int j=i+1;j<size;j++)
{
if(arr[i] >arr[j])
{

temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}//end of if
}//end of for
cout<<arr[i]<<“\n”;
}//end of for
}
int main()
{
int arr[]={1,12,5,4,6};
bubblesort(arr,5);
}

Advertisements

About qainterviews

Software Geek,QA Expert,Blogger
This entry was posted in C++, Data Structures, Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s