Determine the correct running times for each recursive functions 1. If T(n) = T([n/2]) + 1, then T(n) belongs to a) O(log2n) b) O(n) c) Ω(log2n) d) Ω(n) e) Ω (√n) 2. If T(n) = T(n-1) + n, then T(n) belongs to a)O(log2n) b)O(n) c) Ω(log2n) d) Ω(n) e) Θ(n2)
Determine the correct running times for each recursive functions 1. If T(n) = T([n/2]) + 1, then T(n) belongs to a) O(log2n) b) O(n) c) Ω(log2n) d) Ω(n) e) Ω (√n) 2. If T(n) = T(n-1) + n, then T(n) belongs to a)O(log2n) b)O(n) c) Ω(log2n) d) Ω(n) e) Θ(n2)
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
Related questions
Question
100%
Determine the correct running times for each recursive functions
1. If T(n) = T([n/2]) + 1, then T(n) belongs to
a) O(log2n)
b) O(n)
c) Ω(log2n)
d) Ω(n)
e) Ω (√n)
2. If T(n) = T(n-1) + n, then T(n) belongs to
a)O(log2n)
b)O(n)
c) Ω(log2n)
d) Ω(n)
e) Θ(n2)
3. If T(n) = 2T([n/2] + √n, then T(n) belongs to
a) O(n log2n)
b) O(n)
c) Ω(n log2n)
d) Ω(n)
e) Θ(n2)
4. If T(n) = 16T([n/4]) + n2 , then T(n) belongs to
a) O(n log2n)
b) O(n)
c) Ω(n log2n)
d) Ω(n)
e) Θ(n2)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education