6e:I[38030,["70161","$1e","88847","$1f","88834","$20","14399","$21","84313","$22","19254","$19","17558","$23","83253","$24","58059","$25","3196","$26","52567","$1a","80321","$27","80363","$28"],"default"] 64:[["$","p","0",{"children":[["$","$1","0",{"children":[["$","$1","0",{"children":"You have an array of "}]]}],["$","$1","1",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

n

"}}]]}]}],["$","$1","2",{"children":[["$","$1","0",{"children":" elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is"}]]}]]}]] 65:["$","ol",null,{"className":"mt-4 list-none space-y-2 pl-0","data-ssr-question-options":true,"children":[["$","li","A",{"children":[["$","span",null,{"className":"font-semibold","children":["A","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

O (n^2)

"}}]]}]}]]}]]]}],["$","li","B",{"children":[["$","span",null,{"className":"font-semibold","children":["B","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

O(n \\log n)

"}}]]}]}]]}]]]}],["$","li","C",{"children":[["$","span",null,{"className":"font-semibold","children":["C","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

\\theta (n \\ log \\ n)

"}}]]}]}]]}]]]}],"$L6d"]}] 66:["$","p",null,{"className":"mt-3 text-sm text-content-secondary","data-ssr-question-analytics":true,"children":["Attempted by ",865," students","","."]}] 67:["$","div",null,{"id":"locked-question-solution","className":"kg-paywalled-solution","data-ssr-solution-paywall":true,"children":[["$","p",null,{"children":"Sign up free to check your answer"}],["$","a",null,{"href":"/auth/login?redirect=%2Flearn%2FALGORITHMS%2Falgorithim%2Fsorting-algorithms%2Fquick-sort%2Fpyq-questions%3Fq%3D68ecacf895474565f43f0046","className":"underline","children":"Sign up free"}]]}] 68:["$","nav",null,{"aria-label":"More questions in this collection","className":"mt-8","data-ssr-question-nav":true,"children":[["$","p",null,{"className":"text-sm text-content-secondary","children":["Question ",7," of ",20," ",["$","span",null,{"className":"inline-flex shrink-0 text-xs font-medium text-content-muted","children":"Q3648"}]," in"," ",["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions","className":"text-content-success hover:underline","children":"PYQ Questions"}],"."]}],["$","ul",null,{"className":"mt-2 flex list-none flex-wrap gap-x-4 gap-y-2 pl-0 text-sm","children":[["$","li",null,{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=68ecacd495474565f43efcb8","className":"text-content-success hover:underline","data-ssr-question-prev":true,"children":"← Previous question"}]}],["$","li",null,{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=691ecfc43ac59a7ddd32efdf","className":"text-content-success hover:underline","data-ssr-question-next":true,"children":"Next question →"}]}],[["$","li","68ecac6e95474565f43ef3ce",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=68ecac6e95474565f43ef3ce","className":"text-content-success hover:underline","children":["Question ",2]}]}],["$","li","68ecac8895474565f43ef595",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=68ecac8895474565f43ef595","className":"text-content-success hover:underline","children":["Question ",3]}]}],["$","li","68ecac9a95474565f43ef71d",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=68ecac9a95474565f43ef71d","className":"text-content-success hover:underline","children":["Question ",4]}]}],["$","li","68ecacb695474565f43ef9d9",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=68ecacb695474565f43ef9d9","className":"text-content-success hover:underline","children":["Question ",5]}]}],["$","li","691ed0203ac59a7ddd32fd47",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=691ed0203ac59a7ddd32fd47","className":"text-content-success hover:underline","children":["Question ",9]}]}],["$","li","691ed0243ac59a7ddd32fdbc",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=691ed0243ac59a7ddd32fdbc","className":"text-content-success hover:underline","children":["Question ",10]}]}],["$","li","691ed0543ac59a7ddd33042f",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=691ed0543ac59a7ddd33042f","className":"text-content-success hover:underline","children":["Question ",11]}]}],["$","li","691ed06b3ac59a7ddd3307d3",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/sorting-algorithms/quick-sort/pyq-questions?q=691ed06b3ac59a7ddd3307d3","className":"text-content-success hover:underline","children":["Question ",12]}]}]]]}]]}] 69:["$","p",null,{"className":"mt-8","children":["$","$L63",null,{"href":"/courses/ALGORITHMS","className":"inline-block rounded-lg bg-surface-success-strong px-5 py-2.5 font-semibold text-content-inverse","data-ssr-enroll-cta":true,"children":["Explore the full course:"," ","Algorithms"]}]}] 6b:["$","div",null,{"data-learn-authed-skeleton":true,"className":"min-h-[var(--kg-design-utility-min-h-451bd10b)]","children":["$","$L6e",null,{"variant":"question"}]}]

You have an array of \(n\) elements. Suppose you implement quicksort by always…