Skip to content

Bogo sort added #41

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

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open
Changes from 1 commit
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
Prev Previous commit
Next Next commit
Update Code.java
  • Loading branch information
TheiaDraizer authored Dec 19, 2024
commit c08ab4db4446f28dc4daa4f1adea9665536527ae
5 changes: 1 addition & 4 deletions Brute Force/Bogo Sort/Code.java
Original file line number Diff line number Diff line change
Expand Up @@ -52,10 +52,9 @@ void bogosort(int[] array) {
// }
}

// Creating a unique array with random integers

Integer[] uniqueArray = (Integer[]) new Randomize.Array1D(4, new Randomize.Integer(1, 9)).create();

// Constructor
Main() {
int a = uniqueArray[0];
int b = uniqueArray[1];
Expand All @@ -68,11 +67,9 @@ void bogosort(int[] array) {
Tracer.delay();
// }

// Call the bogosort function
bogosort(new int[]{a, b, c, d});
}

// Main method to run the program
public static void main(String[] args) {
new Main();
}
Expand Down