Scribd Logo
Upload

Welcome to Scribd!

  • Exercise 6

    Uploaded by

    inbvt esxcd
    27 views2 pages
    The document discusses issues that can arise when sorting an array with duplicate keys using a recursive sorting algorithm like quicksort, as duplicate keys can result in an unbalanced recursion tree with worst-case quadratic complexity. It notes that with a constant number of distinct keys, the array can only have a limited number of possible partition cases, and proposes that by treating duplicated values as a single value, the problem can be viewed as the same single-value partitioning problem with the same lower time complexity bound of O(n log n).

    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 discusses issues that can arise when sorting an array with duplicate keys using a recursive sorting algorithm like quicksort, as duplicate keys can result in an unbalanced recursion tree with worst-case quadratic complexity. It notes that with a constant number of distinct keys, the array can only have a limited number of possible partition cases, and proposes that by treating duplicated values as a single value, the problem can be viewed as the same single-value partitioning problem with the same lower time complexity bound of O(n log n).

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    27 views2 pages

    Exercise 6

    Uploaded by

    inbvt esxcd
    The document discusses issues that can arise when sorting an array with duplicate keys using a recursive sorting algorithm like quicksort, as duplicate keys can result in an unbalanced recursion tree with worst-case quadratic complexity. It notes that with a constant number of distinct keys, the array can only have a limited number of possible partition cases, and proposes that by treating duplicated values as a single value, the problem can be viewed as the same single-value partitioning problem with the same lower time complexity bound of O(n log n).

    Copyright:

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

    EXERCISEG

    Question

    T.Whenmanykeysareduplicated.ch anging
    one of > = or < = +0

    > oraresultinaunbalancedrecursiontr.ee

    Torexampleasubarraywithidentic.ae elements

    7770rigind

    andchi-IEII-EI_llin-ionextrecursionp.ro
    ( < = and > =
    ) > =

    t nextrewsioi
    7 and < =

    1⾯ ⼱1⽇

    plexityissameastheworst-caseOM30neduplicatedkeylwh.ch
    Asthishappened.the.com

    eventuaytrmansubarraywithidenticaldementsintherecu.rs ion )

    wouldresultinthiscaseonce-squadratic.com
    plexiywithaconstantnumberofdist.netkeys
    Question 2 .

    3 -

    way partition

    5 inceweonlyhavetwodistincekeys.therecanonybe2.cases

    Case

    IǕ
    Case

    I.i-p-lapThistakesn-lcompa.is
    ns.andthearrayissoreed-socnjnonly2possiblevalues
    。
    Question 3 ,

    Ifwecando3-waypartitioninocnstimewe.ca

    nthinkoftheduplicatedvaluesasonesinglevalue.SI
    considerasThenwehavethe xactsamecaseastheor.si nd quicksort

    samelowerboundocne.gr )

    You might also like