mirror of
https://github.com/c0de-archive/hacktoberfest-2018.git
synced 2024-12-22 05:12:40 +00:00
Merge pull request #275 from ashish010598/patch-1
Create hactoberfest_noob
This commit is contained in:
commit
dd612a4842
42
code/ashish010598.cpp
Normal file
42
code/ashish010598.cpp
Normal file
@ -0,0 +1,42 @@
|
||||
|
||||
// C program for implementation of Bubble sort
|
||||
#include <stdio.h>
|
||||
|
||||
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++)
|
||||
printf("%d ", arr[i]);
|
||||
printf("n");
|
||||
}
|
||||
|
||||
// Driver program to test above functions
|
||||
int main()
|
||||
{
|
||||
int arr[] = {64, 34, 25, 12, 22, 11, 90};
|
||||
int n = sizeof(arr)/sizeof(arr[0]);
|
||||
bubbleSort(arr, n);
|
||||
printf("Sorted array: \n");
|
||||
printArray(arr, n);
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user