UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication
| dc.contributor.author | Dr. Sasikumar Periyannan | |
| dc.date.accessioned | 2022-02-23T05:19:04Z | |
| dc.date.available | 2022-02-23T05:19:04Z | |
| dc.date.issued | 2019 | |
| dc.identifier.uri | http://10.10.11.6/handle/1/4980 | |
| dc.publisher | GALGOTIAS UNIVERSITY | en_US |
| dc.subject | Design and Analysis of Algorithms | en_US |
| dc.title | UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication | en_US |