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

Update bubble_sort.c #280

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
99 changes: 60 additions & 39 deletions Competitive Coding/Sorting/Bubble Sort/bubble_sort.c
Original file line number Diff line number Diff line change
@@ -1,46 +1,67 @@
#include <stdio.h>

// BUBBLE SORT
void swap (int array[], int j){
int aux = 0;
aux = array[j];
array[j] = array[j+1];
array[j+1] = aux;
}

#include <stdio.h>
void bubbleSort(int array[], int size, int order){
if(order == 1){
for(int i=0; i < size-1; i++){
int flag = 0;

void swap(int*,int*);

void bubblesort(int arr[], int size)
{
int i, j;
for (i = 0; i < size - 1; i++) // Function where the actual algorithm is implemented
{
for (j = 0; j < size - i - 1; j++)
{
if (arr[j] > arr[j+1])
swap(&arr[j], &arr[j+1]);

for(int j=0; j<size-1-i; j++){
if(array[j] > array[j+1]){
swap(array, j);
flag = 1;
}
}
if(flag == 0){
break;
}
}
}

else if(order == 2){
for(int i=0; i < size-1; i++){
int flag = 0;

for(int j=0; j<size-1-i; j++){
if(array[j] < array[j+1]){
swap(array, j);
flag = 1;
}
}
if(flag == 0){
break;
}
}
}
}
void swap(int *a, int *b)
{
int temp; // Function for swapping two variables
temp = *a;
*a = *b;
*b = temp;
}
int main()
{
int array[100], i, size;
printf("How many numbers you want to sort: "); // Enter the numbers to sort

scanf("%d", &size);

printf("\nEnter %d numbers : ", size);
for (i = 0; i < size; i++)
scanf("%d", &array[i]);
bubblesort(array, size);
printf("\nSorted array is ");

for (i = 0; i < size; i++)
printf(" %d ", array[i]);
printf(" ");
return 0;

int main() {
int size;
int order;

printf("Enter the size of the array:\n");
scanf("%i", &size);

int array[size];

printf("Enter the elements of the array:\n");
for(int i = 0; i < size; i++){
scanf("%i", &array[i]);
}

printf("What type of ordering do you want: \n 1 - Ascending \n 2 - Descending\n");
scanf("%i", &order);

bubbleSort(array, size, order);

printf("The sorted array is:\n");
for (int i = 0; i < size; i++){
printf("%i ", array[i]);
}
return 0;
}