ALGO2(A)// A is an integer array, index starting at 1 1:for i=1 to n-1 do 2: for j=n to i+1 do 3:    if (A[j] < A[j-1]) then 4:      exchange A[j] with A[j-1] Which function best describes the worst-case running time behaviour of ALGO2 on an array of size n?

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter12: Points, Classes, Virtual Functions And Abstract Classes
Section: Chapter Questions
Problem 29SA
icon
Related questions
Question

ALGO2(A)// A is an integer array, index starting at 1
1:for i=1 to n-1 do
2: for j=n to i+1 do
3:    if (A[j] < A[j-1]) then
4:      exchange A[j] with A[j-1]

Which function best describes the worst-case running time behaviour of ALGO2 on an array of size n?

Option 1) a*(n^2) + b*n +c, where a,b,c are constants
Option 2) a*n + b , where a and b are constants
Option 3) a * n * log(n) + b, where a,b are constants
Option 4) a*(n^3) + b*(n^2) + c*n + d, where a,b,c,d are constants

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Arrays
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
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning