Get the time complexity of each of the following: 1) for (int i = 1; i <=n; i += c) { for (int j = 1; j <=n; j += c) { cout<<”YAY”; } }
Get the time complexity of each of the following:
1)
for (int i = 1; i <=n; i += c) {
for (int j = 1; j <=n; j += c) {
cout<<”YAY”;
}
}
2)
template <class Item>
void bubleSort(Item a[], int n)
{
bool sorted = false;
int last = n-1;
for (int i = 0; (i < last) && !sorted; i++){
sorted = true;
for (int j=last; j > i; j--)
if (a[j-1] > a[j]{
swap(a[j],a[j-1]);
sorted = false; // signal exchange
}
}
}
3)
for (int i = 1; i <=n; i ++) {
for (int i = 1; i <=n; i ++) {
for (int i = 1; i <=n; i ++) {
for (int j = 1; j <=n; j+=3) {
Cout <<”YAY”;
}
}
4)
int i, j, k = 0;
for (i = 1; i <= n; i++)
for (i = 1; i <= n; i++)
for (i = 2; i <= n; i++)
for (j = 1; j <= n; j = j * 2)
k = k + n / 2;
Step by step
Solved in 3 steps
