Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Created Bubble_sort.cpp #51

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
79 changes: 79 additions & 0 deletions Bubble_sort.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,79 @@

#include <iostream>
using namespace std;

//Compiler version g++ 6.3.0

// C++ program for implementation of Bubble sort
#include <bits/stdc++.h>

using namespace std;



void swap(int *xp, int *yp)
{

int temp = *xp;

*xp = *yp;

*yp = temp;
}


// A function to implement bubble sort

void bubbleSort(int arr[], int n)
{

int i, j;

for (i = 0; i < n-1; i++)

// Last i elements are already in place

for (j = 0; j < n-i-1; j++)

if (arr[j] > arr[j+1])

swap(&arr[j], &arr[j+1]);

}

/* Function to print an array */

void printArray(int arr[], int size)
{

int i;

for (i = 0; i < size; i++)

cout << arr[i] << " ";

cout << endl;
}


// Driver code

int main()
{

int arr[] = {4, 8, 5, 3, 9, 6, 2, 7, 1};

int n = sizeof(arr)/sizeof(arr[0]);

bubbleSort(arr, n);

cout<<"Sorted array: \n";

printArray(arr, n);

return 0;
}



// This code is contributed by Ayush Sinha