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.

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

Jump to bottom

Improve bubble sort algorithm performance #197

Closed
wants to merge 4 commits into from
Closed

Improve bubble sort algorithm performance #197

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
b7fe499
Improve bubble sort algorithm performance
hammadsaedi Oct 4, 2023
12afa79
package declaration on the top
hammadsaedi Oct 16, 2023
806abd1
update: license
hammadsaedi Oct 16, 2023
3a64d7a
bubble sort: same as before
hammadsaedi Oct 16, 2023
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
50 changes: 25 additions & 25 deletions src/main/java/algorithm/BubbleSortSnippet.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,29 +22,29 @@
* SOFTWARE.
*/

package algorithm;
package algorithm;

/**
* BubbleSortSnippet.
*/
public class BubbleSortSnippet {

/**
* Sort an array with bubbleSort algorithm.
*
* @param arr array to sort
*/
public static void bubbleSort(int[] arr) {
var lastIndex = arr.length - 1;

for (var j = 0; j < lastIndex; j++) {
for (var i = 0; i < lastIndex - j; i++) {
if (arr[i] > arr[i + 1]) {
var tmp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = tmp;
}
}
}
}
}
/**
* BubbleSortSnippet.
*/
public class BubbleSortSnippet {
/**
* Sort an array with bubbleSort algorithm.
*
* @param arr array to sort
*/
public static void bubbleSort(int[] arr) {
var lastIndex = arr.length - 1;
for (var j = 0; j < lastIndex; j++) {
for (var i = 0; i < lastIndex - j; i++) {
if (arr[i] > arr[i + 1]) {
var tmp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = tmp;
}
}
}
}
}
Loading