Scribd Logo
Upload

Welcome to Scribd!

  • Algo Unsolved in Class

    Uploaded by

    Ashutosh Gupta
    3 views1 page
    This document discusses Mergesort and provides questions about its implementation and analysis. It asks about an in-place merging procedure for Mergesort to address space criticisms, provides no content for one question, asks about estimating maximum input size that can be solved in 6 minutes given worst case time for size 64 is 30 seconds, and asks about the number of comparisons needed in the worst case when merging two sorted lists of sizes m and n.

    Original Description:

    Algo question

    Original Title

    algo unsolved in class

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses Mergesort and provides questions about its implementation and analysis. It asks about an in-place merging procedure for Mergesort to address space criticisms, provides no content for one question, asks about estimating maximum input size that can be solved in 6 minutes given worst case time for size 64 is 30 seconds, and asks about the number of comparisons needed in the worst case when merging two sorted lists of sizes m and n.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    Algo Unsolved in Class

    Uploaded by

    Ashutosh Gupta
    This document discusses Mergesort and provides questions about its implementation and analysis. It asks about an in-place merging procedure for Mergesort to address space criticisms, provides no content for one question, asks about estimating maximum input size that can be solved in 6 minutes given worst case time for size 64 is 30 seconds, and asks about the number of comparisons needed in the worst case when merging two sorted lists of sizes m and n.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Q1 

     
     

    Q2. Mergesort is being criticized because of extra space it requires for merging. Describe a 
    procedure for in place merging. 

    Q3

     
     

    Q4 Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. 
    Which of the following most closely approximates the maximum input size of a problem that can be 
    solved in 6 minutes?   

    Q5 Given two sorted list of size 'm' and 'n' respectively. The number of comparisons needed in the 
    worst case by the merge sort algorithm will be_______ 

    You might also like