Skip to content

Update Bubble_Sort.cpp #21

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.

Sign up for GitHub

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

Open
Arghajyoti wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update Bubble_Sort.cpp #21

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
16 changes: 8 additions & 8 deletions Bubble_Sort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,20 +1,20 @@
#include<iostream>
using namespace std;
void printArray(int *a,int k)
void printArray(int *a,int b)
{
for(int i=0;i<k;i++)
for(int i=0;i<b;i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
}

void bubbleSort(int *a,int k)
void bubbleSort(int *a,int b)
{
int temp;
for(int j=0;j< k-1;j++)
for(int j=0;j< b-1;j++)
{
for(int i=0;i< k-1;i++)
for(int i=0;i< b-1;i++)
{
if(a[i]>a[i+1])
{
Expand All @@ -25,15 +25,15 @@ void bubbleSort(int *a,int k)
}
}
}
void bubbleSortAdaptive(int *a,int k)
void bubbleSortAdaptive(int *a,int b)
{
int temp;
int isSorted=1;
for(int j=0;j< k-1;j++)
for(int j=0;j< b-1;j++)

{
cout<<"Program working on pass number "<<j+1<<endl;
for(int i=0;i< k-1;i++)
for(int i=0;i< b-1;i++)

{
if(a[i]>a[i+1])
Expand Down