Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
C
Core Java and Java 8
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Lokesh Singh
Core Java and Java 8
Commits
02053e29
Unverified
Commit
02053e29
authored
Jan 10, 2022
by
Lokesh Singh
Committed by
GitHub
Jan 10, 2022
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update bubble sort
parent
78cb4256
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
26 additions
and
1 deletion
+26
-1
bubble sort
bubble sort
+26
-1
No files found.
bubble sort
View file @
02053e29
void swap(int *xp, int *yp)
//cpp funtion for sorting using bubble sort
//
void swap(int *xp, int *yp)
{
{
int temp = *xp;
int temp = *xp;
*xp = *yp;
*xp = *yp;
...
@@ -17,3 +19,26 @@ void swap(int *xp, int *yp)
...
@@ -17,3 +19,26 @@ void swap(int *xp, int *yp)
}
}
}
}
}
}
//
//java funtion
public static void bubbleSort(int arr[], int n)
{
//code here
int i, j;
//Traversing over the array.
for (i = 0; i < n-1; i++)
{
//Last i elements are already in place so we do not include them.
for (j = 0; j < n-i-1; j++)
if(arr[j] > arr[j+1])
{
//Swapping, if the element at current index is greater
// than the next element.
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment