48 lines
1.1 KiB
C++
48 lines
1.1 KiB
C++
#include <cstddef>
|
|
#include <cstdio>
|
|
#include <cstdlib>
|
|
#include <vector>
|
|
|
|
void bsort(std::vector<int> &input_vec){
|
|
/*
|
|
voor elk nummer i in k behalve de laatste
|
|
ga langs elk volgende nummer j behalve de laatste
|
|
en kijk of i+1 groter is dan i, als i groter is dan j, verplaats i naar
|
|
j
|
|
*/
|
|
|
|
for (size_t i = 0; i < input_vec.size(); i++) {
|
|
printf("%zu\n", i);
|
|
for (size_t j = 0; j < input_vec.size()-1-i; j++) {
|
|
if (input_vec[j]>input_vec[j+1]) {
|
|
int temp = input_vec[j + 1];
|
|
input_vec[j + 1] = input_vec[j];
|
|
input_vec[j] = temp;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// returns an array of length filled with random positive integers of up to max
|
|
std::vector<int> createranarr(size_t input_length, size_t max){
|
|
std::vector<int> myv;
|
|
for (size_t i = 0; i < input_length; i++) {
|
|
myv.push_back(rand() % max);
|
|
}
|
|
return myv;
|
|
}
|
|
|
|
void arrprinter(const std::vector<int> &input_vec) {
|
|
for (size_t i = 0; i < input_vec.size(); i++) {
|
|
std::printf("number:%zu = %d\n",i, input_vec[i]);
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
std::vector<int> myvector = createranarr(10, 100);
|
|
arrprinter(myvector);
|
|
bsort(myvector);
|
|
arrprinter(myvector);
|
|
return 0;
|
|
}
|