What will be the time complexity of the func() function in the following code?…

PYQ TCS NQT 2024

What will be the time complexity of the func() function in the following code?

using namespace std;

void func(int a[], int n, int k)

{

if (k <= n)

{

for (int i = 0; i < k/2; i++)

swap(a[i], a[k-i-1]);

}

}

int main()

{

int a[] = {1, 2, 3, 4, 5};

int n = sizeof(a) / sizeof(int), k = 3;

func(a, n, k);

for (int i = 0; i < n; ++i)

cout << a[i]<<" ";

return 0;

}

  1. A.

    O(k)

  2. B.

    O(n)

  3. C.

    O(k log k)

  4. D.

    O(n log n)

Attempted by 152 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…