1. What is the time complexity of the following function? def my_function(my_list, element):        first_item = 0        last_item = len(my_list) - 1        is_found = False        while first_item <= last_item and not is_found:              mid = (first_item + last_item)//2               if my_list[mid] == element:                    is_found = True              else:                     if element < mid:                            last_item = mid - 1                     else:                             first_item = mid + 1         return is_found Group of answer choices a) O(1) b) O(logn) c) O(n) d) O(nlogn)   2. Here is the comparison for asymptotic growth rate: (logn) < (n) < (nlogn) < (n^2) < (n^3) < (2^n) Group of answer choices a) True b) False

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

1. What is the time complexity of the following function?

def my_function(my_list, element):
       first_item = 0
       last_item = len(my_list) - 1
       is_found = False
       while first_item <= last_item and not is_found:
             mid = (first_item + last_item)//2
              if my_list[mid] == element:
                   is_found = True
             else:
                    if element < mid:
                           last_item = mid - 1
                    else:
                            first_item = mid + 1
        return is_found
Group of answer choices
a) O(1)
b) O(logn)
c) O(n)
d) O(nlogn)
 

2. Here is the comparison for asymptotic growth rate:

(logn) < (n) < (nlogn) < (n^2) < (n^3) < (2^n)

Group of answer choices
a) True
b) False
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Lists
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
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