EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter2: Using Data
Section: Chapter Questions
Problem 14RQ
icon
Related questions
Question

What is the time complexity for the following algorithm?

Select one:
a. Θ(n3)
b. Θ(n2)
c. Θ(log n)
d. Θ(n)
int i=0;
while (i<n)
{
if (x==A[i])
{
for (j=0;j<n;j++)
C=c+1;
return i;
}
i=i+1;
}
return -1;
Transcribed Image Text:int i=0; while (i<n) { if (x==A[i]) { for (j=0;j<n;j++) C=c+1; return i; } i=i+1; } return -1;
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Computational Systems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT