‹ Back to the paper
For the given code segment, write Big O notation for worst case complexity. int i=1, j=1, k=1, p…
For the given code segment, write Big O notation for worst case complexity.
int i=1, j=1, k=1, p;
while (i <= p)
{
statements
}
while (j <= p)
{
while (k <= p)
{
statements
}
}Answer
No answer yet.
From ISC 2025 Improvement Computer Science Paper 1, question 1(x).