Question
Quick Sort, another Divide and Conquer algorithm,
partitions an array around a pivot. The choice of pivot can significantly impact its performance. What is its worst-case time complexity?Solution
In the worst case for Quick Sort, the pivot selection consistently results in highly unbalanced partitions (e.g., always picking the smallest or largest element as the pivot). This leads to one subproblem of size N-1 and another of size 0, effectively degenerating into a selection sort-like behavior, resulting in O(N²) time complexity.
ABC Ltd’s purchases during the year were Rs 200000. The balance sheet shows an average accounts payable balance of Rs 15000. ABC’s payables ...
What type of risk does the Liquidity Coverage Ratio (LCR) aim to address under Basel III?​
Bank credit to NBFCs (including HFCs) for on-lending will be allowed up to what limit of an individual bank’s total priority sector lending in case of...
Regional Rural Banks (RRBs) were established in which year?​
What is one of the major objectives of SIDBI?
Which of the following methods helps convert receivables to instant cash?​
The sponsor banks of RRBs are usually:​
Which of the following does not contribute to credit risk?​
Expand FEDAI
Primary Agricultural Credit Societies (PACS) operate at the:​
