-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgeneration.cpp
More file actions
76 lines (57 loc) · 1.71 KB
/
generation.cpp
File metadata and controls
76 lines (57 loc) · 1.71 KB
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
ofstream file("arrays.csv");
if (!file){
cout<<"File could not be opened :/"<<endl;
return 0;
}
srand(time(0));
for (int a = 0; a < 100; a++){ //100 arrays generate karane hai
int n = rand()%971 + 30; //array ka size
vector<int> original;
for (int i =0; i < n; i++){
original.push_back(rand()%1000);
}
for (int j = 0; j < 8; j++){ // 8 shuffled
vector<int> temp = original;
random_shuffle(temp.begin(), temp.end());
file << "S," << n << ",";
for (int k = 0; k < temp.size(); k++){
file << temp[k];
if (k != temp.size() - 1){
file << ",";
}
}
file << endl;
}
vector<int> sortedArray = original;
sort(sortedArray.begin(), sortedArray.end());
file << "A," << n << ",";
for (int i = 0; i < sortedArray.size(); i++){ //ascending
file << sortedArray[i];
if (i != sortedArray.size() - 1){
file << ",";
}
}
file << endl;
vector<int> descArray = sortedArray;
reverse(descArray.begin(), descArray.end()); //descending
file << "D," << n << ",";
for (int i = 0; i < descArray.size(); i++) {
file << descArray[i];
if (i != descArray.size() - 1) {
file << ",";
}
}
file << endl;
}
file.close();
cout<< "1000 arrays generated successfully :)"<< endl;
return 0;
}