Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
UsingAlgorithm
//g++ 7.4.0 //using algorithm #include <iostream> #include <algorithm> #include <vector> #include <ctime> using namespace std; const int len=10; vector<int> list; void get_list(){ for (unsigned int i=0;i<list.size();i++){ cout<<list[i]<<","; } cout<<endl; } int main() { for (int i=0;i<len;i++){ list.push_back(rand()%10); } cout << "Using Algorithm !!! \n[ * Random List]:"; get_list(); cout << "[ * Sorted List]:"; sort(list.begin(),list.end()); get_list(); }
run
|
edit
|
history
|
help
0
Perf measurement
string match
Bucket Graph Creation
QuadRootPoint
without HLD range Quey can be handled by just using segment tree on the FLATTENED TREE (euler tour)
Merge overlapping time intervals
binary
queueArray
Factoriel
Sekhejane link