I. O(n) II. O(log n) III. O(n^2) IV. O(n log n) V. None of the above

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
The complexity of Binary search algorithm is
I. O(n)
II. O(log n)
II. O(n^2)
IV. O(n log n)
V. None of the above
O IV
ov
O|I
>
Transcribed Image Text:The complexity of Binary search algorithm is I. O(n) II. O(log n) II. O(n^2) IV. O(n log n) V. None of the above O IV ov O|I >
What is the time complexity of the following algorithm power(n.x).? Assume that each operation takes a unit time.
LongPower(int n, int x) {
long ans;
if(n==0) return 1;
elsel
ans = Power (n/2, x) * Power (n/2, x);
if (n % 2 == 1) ans *= x;
return ans;
A: Ө (n)
B: Ө (ogn)
C: e (n logn)
D: e (n^2)
E: None of the above
O A
B
D
O E
C.
Transcribed Image Text:What is the time complexity of the following algorithm power(n.x).? Assume that each operation takes a unit time. LongPower(int n, int x) { long ans; if(n==0) return 1; elsel ans = Power (n/2, x) * Power (n/2, x); if (n % 2 == 1) ans *= x; return ans; A: Ө (n) B: Ө (ogn) C: e (n logn) D: e (n^2) E: None of the above O A B D O E C.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Public key encryption
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education