Atharva legolas12.hashnode.net·Jan 7, 2023Daily Dose of DSA - Day 3void printgreater(int arr[], int n) // naive approach θ(n²) { for (int i = 0; i < n; i++) // traverse the array { int count = 0; for (int j = 0; j < n; j++) if (j != i && arr[j] > arr[i]) count++; /...Discuss·98 readsstlinc++
Atharva legolas12.hashnode.net·Jan 7, 2023Daily Dose of DSA - Day 3void printgreater(int arr[], int n) // naive approach θ(n²) { for (int i = 0; i < n; i++) // traverse the array { int count = 0; for (int j = 0; j < n; j++) if (j != i && arr[j] > arr[i]) count++; /...Discuss·98 readsstlinc++
