-
Notifications
You must be signed in to change notification settings - Fork 0
/
bubbleSort.cpp
55 lines (50 loc) · 1.17 KB
/
bubbleSort.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <stdio.h>
#include <chrono>
#include <iostream>
#include <fstream>
#include <string>
void bubbleSort(int * tab, int l);
int N = 1000000;
std::string nazwa = "1000kV.txt ";
std::string tmp = "testy\\";
std::string sciezka = tmp+nazwa;
int main()
{
std::ifstream plik;
plik.open(sciezka);
int * tab = new int [N];
for(int i = 0; i < N; i++)
{
plik>>tab[i];
}
plik.close();
auto start = std::chrono::steady_clock::now();
bubbleSort(tab,N);
auto finnish = std::chrono::steady_clock::now();
std::cout << nazwa << "(ms) " << (std::chrono::duration_cast<std::chrono::nanoseconds>(finnish - start).count())/1000000.0 <<std::endl;
return 0;
}
void zamien(int &a, int &b)
{
int tmp = a;
a = b;
b = tmp;
}
void bubbleSort(int * tab, int l)
{
bool flag = false;
for(int i = 0; i < l-1; i++)
{
flag = false;
for(int j = 0; j < l - i - 1; j++)
{
if(tab[j] > tab[j+1])
{
zamien(tab[j], tab[j+1]);
flag = true;
}
}
if(!flag)
break;
}
}