Given the ff. algorithm to find the greatest common divisor of n and m where n s m, determine the time complexity: algorithm GCD(n,m) if n = 0 then return m т — т -— п if n < m then return GCD(n, m) else return GCD(m,n) O None of the choices e(m) O(m*) O(m) O(m lg m)

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

Answer the 2 questions, will upvote if complete, short solution/explanation will do

Given the ff. algorithm to find the greatest common divisor of n and m
where ns m, determine the time complexity:
algorithm GCD(n,m)
if n = 0 then
return m
т — т — п
if n < m then return GCD(n, m)
else return GC D(m,n)
O None of the choices
e(m)
O(m?)
O(m)
O(m lg m)
Transcribed Image Text:Given the ff. algorithm to find the greatest common divisor of n and m where ns m, determine the time complexity: algorithm GCD(n,m) if n = 0 then return m т — т — п if n < m then return GCD(n, m) else return GC D(m,n) O None of the choices e(m) O(m?) O(m) O(m lg m)
Approximately, how many levels does a merge sort recursion tree have, as a function of the length n of the input array?
constant number (independent of n)
sqrt(n)
None of the choices
n log, n
log, n
Transcribed Image Text:Approximately, how many levels does a merge sort recursion tree have, as a function of the length n of the input array? constant number (independent of n) sqrt(n) None of the choices n log, n log, n
Expert Solution
steps

Step by step

Solved in 2 steps

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