Scribd Logo
Upload

Welcome to Scribd!

  • Assignment 3

    Uploaded by

    Aditya Balachander
    9 views1 page
    The document provides instructions for Assignment 3 which is due by October 26th, 2020 at 5pm IST. Students should email their submissions to office.of.gr@gmail.com with the subject "Assignment Number [3]: Algorithms, 2020" and include their name and roll number. The assignment covers sorting algorithms and contains 5 questions about analyzing the runtime of merge sort, a variation of quicksort, removing duplicates from a collection, sorting in linear time, and the best case for quicksort.

    Original Description:

    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
    The document provides instructions for Assignment 3 which is due by October 26th, 2020 at 5pm IST. Students should email their submissions to office.of.gr@gmail.com with the subject "Assignment Number [3]: Algorithms, 2020" and include their name and roll number. The assignment covers sorting algorithms and contains 5 questions about analyzing the runtime of merge sort, a variation of quicksort, removing duplicates from a collection, sorting in linear time, and the best case for quicksort.

    Copyright:

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

    Assignment 3

    Uploaded by

    Aditya Balachander
    The document provides instructions for Assignment 3 which is due by October 26th, 2020 at 5pm IST. Students should email their submissions to office.of.gr@gmail.com with the subject "Assignment Number [3]: Algorithms, 2020" and include their name and roll number. The assignment covers sorting algorithms and contains 5 questions about analyzing the runtime of merge sort, a variation of quicksort, removing duplicates from a collection, sorting in linear time, and the best case for quicksort.

    Copyright:

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

    Assignment 3

    ● Due by​ 26th October, 2020, 5pm IST.


    ● To be submitted to the following email address: ​office.of.gr@gmail.com
    ● The subject of the email should be: ​Assignment Number [3]: Algorithms, 2020
    ● Please mention your name and roll number.
    ● Topic: Sorting

    1. Show that the running time of the merge-sort algorithm on ​n​-element sequence is
    O(n log n), even when ​n​ is not a power of 2.

    2. Consider a modification of the deterministic version of the quick-sort algorithm


    where we choose the element at index ⌊n/2⌋ as our pivot. Describe the kind of
    sequence that would cause this version of quick-sort to run in Ω(n2 ) time.

    3. Describe and analyze an efficient method for removing all duplicates from a
    collection A
    ​ ​ of n
    ​ ​ elements.

    4. Given an array A of n integers in the range [0, n​2 ​- 1], describe a simple method for
    sorting A in O(n) time.

    5. Show that quicksort’s best-case running time is Ω(n log n).

    You might also like