backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-12 06:56:59 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
sorting/bubble_sort.cpp
View File

@@ -40,8 +40,7 @@ optimized bubble sort algorithm. It's right down there.
#include <iostream>
#include <vector>
int main()
{
int main() {
int n;
bool swap_check = true;
std::cout << "Enter the amount of numbers to sort: ";
@@ -51,20 +50,16 @@ int main()
int num;
// Input
for (int i = 0; i < n; i++)
{
for (int i = 0; i < n; i++) {
std::cin >> num;
numbers.push_back(num);
}
// Bubble Sorting
for (int i = 0; (i < n) && (swap_check); i++)
{
for (int i = 0; (i < n) && (swap_check); i++) {
swap_check = false;
for (int j = 0; j < n - 1 - i; j++)
{
if (numbers[j] > numbers[j + 1])
{
for (int j = 0; j < n - 1 - i; j++) {
if (numbers[j] > numbers[j + 1]) {
swap_check = true;
std::swap(numbers[j],
numbers[j + 1]); // by changing swap location.
@@ -77,14 +72,10 @@ int main()
// Output
std::cout << "\nSorted Array : ";
for (int i = 0; i < numbers.size(); i++)
{
if (i != numbers.size() - 1)
{
for (int i = 0; i < numbers.size(); i++) {
if (i != numbers.size() - 1) {
std::cout << numbers[i] << ", ";
}
else
{
} else {
std::cout << numbers[i] << std::endl;
}
}