Skip to content

Updated the code efficiently BogoSort.cpp #6

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
Tuhin1500 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Updated the code efficiently BogoSort.cpp #6

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
14 changes: 10 additions & 4 deletions BogoSort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,16 +29,23 @@ void quickSort(std::vector<int>& arr, int low, int high) {
}

int main() {
// Generate random data
std::vector<int> data = {5, 2, 9, 1, 5, 6};
// Generate random data and populate the vector
int n = 6; // Adjust the size as needed
std::random_device rd;
std::mt19937 generator(rd());
std::uniform_int_distribution<int> distribution(1, 100); // Adjust the range as needed
std::vector<int> data;

for (int i = 0; i < n; ++i) {
data.push_back(distribution(generator));
}

std::cout << "Unsorted array: ";
for (int num : data) {
std::cout << num << " ";
}
std::cout << std::endl;

int n = data.size();
quickSort(data, 0, n - 1);

std::cout << "Sorted array: ";
Expand All @@ -49,4 +56,3 @@ int main() {

return 0;
}