Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Juestion which of the following statements about mergesort are true? Unless otherwise specified, assume that mergesort refers to the pure recursive (top-down) version of mergesort (with no optimizations), using the merging subroutine described in lecture. Answer Mark all that apply. OThe number of compares to bottom-up mergesort an array depends only on the length of the array n (and not on the keys or order of the keys in the array). O Mergesort is a stable sorting algorithm. Suppose that n is a power of 2. For any array of n distinct keys, top-down mergesort and bottom-up mergesort compare exactly the same pairs of keys (but possibly in a different order). OMergesort uses only a logarithmic amount of space (other than the input array). OIt is possible to design a compare-based algorithm to merge any two sorted arrays, each of length n, with no more than 3/2 n compares.

Juestion which of the following statements about mergesort are true? Unless otherwise specified, assume that mergesort refers to the pure recursive (top-down) version of mergesort (with no optimizations), using the merging subroutine described in lecture. Answer Mark all that apply. OThe number of compares to bottom-up mergesort an array depends only on the length of the array n (and not on the keys or order of the keys in the array). O Mergesort is a stable sorting algorithm. Suppose that n is a power of 2. For any array of n distinct keys, top-down mergesort and bottom-up mergesort compare exactly the same pairs of keys (but possibly in a different order). OMergesort uses only a logarithmic amount of space (other than the input array). OIt is possible to design a compare-based algorithm to merge any two sorted arrays, each of length n, with no more than 3/2 n compares.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Question Which of the following statements about mergesort are true? Unless otherwise specified, assume that mergesort refers to the pure recursive (top-down) version of mergesort (with no optimizations), using the merging subroutine described in lecture. Answer Mark all that apply. OThe number of compares to bottom-up mergesort an array depends only on the length of the array n (and not on the keys or order of the keys in the array). O Mergesort is a stable sorting algorithm. Suppose that n is a power of 2. For any array of n distinct keys, top-down mergesort and bottom-up mergesort compare exactly the same pairs of keys (but possibly in a different order). OMergesort uses only a logarithmic amount of space (other than the input array). OIt is possible to design a compare-based algorithm to merge any two sorted arrays, each of length n, with no more than 3/2 n compares.
Transcribed Image Text:Question Which of the following statements about mergesort are true? Unless otherwise specified, assume that mergesort refers to the pure recursive (top-down) version of mergesort (with no optimizations), using the merging subroutine described in lecture. Answer Mark all that apply. OThe number of compares to bottom-up mergesort an array depends only on the length of the array n (and not on the keys or order of the keys in the array). O Mergesort is a stable sorting algorithm. Suppose that n is a power of 2. For any array of n distinct keys, top-down mergesort and bottom-up mergesort compare exactly the same pairs of keys (but possibly in a different order). OMergesort uses only a logarithmic amount of space (other than the input array). OIt is possible to design a compare-based algorithm to merge any two sorted arrays, each of length n, with no more than 3/2 n compares.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS