//created by Akshay Jain //Program to get time complexity of any given important algorithms /* Input pattern : 1.Enter index from 1 to 13 for algorithm selection 2.Enter index from 1 to 3 for time complexity selection Output pattern : time_complexity of the selected algorithm */ #include using namespace std; void time_complexity(int,int); int main() { int a,c; cout<<"Enter the Algorithm Index"<>a; while(a<1||a>13){ cout<<"\nInvalid Input, Enter again\n"; cin>>a; } cout<<"\nEnter the complexity index"<>c; while(c<1||c>3){ cout<<"\nInvalid Input, Enter again\n"; cin>>c; } //function to print time_complexity of the algorithm time_complexity(a,c); return 0; } void time_complexity (int a,int c){ //best time_complexity string best[] = {"O[1]","O[1]","O[n]","O[n²]","O[n]","O[nlogn]","O[nlogn]","O[nlogn]","O[n+k]","O[nk]","O[n]","O[n]","O[n+k]"}; //average time_complexity string average[] = {"O[n]","O[logn]","O[n²]","O[n²]","O[n²]","O[nlogn]","O[nlogn]","O[nlogn]","O[n+k]","O[nk]","O[nlogn]","O[(nlogn)²]","O[n+k]"}; //worst time_complexity string worst[] = {"O[n]","O[logn]","O[n²]","O[n²]","O[n²]","O[nlogn]","O[n²]","O[nlogn]","O[n²]","O[nk]","O[nlogn]","O[(nlogn)²]","O[n+k]"}; cout<<"\n\nThe time complexity of the algorithm is "; switch(c){ case 1 : cout<

Time Complexity Generator