<p>Was the last day of my midsem exam, started with dsa as(merge sort). Got to know that we can use divide and conquer technique for merge sorting, first divide the array then sort it then merge it.</p>


Was the last day of my midsem exam, started with dsa as(merge sort). Got to know that we can use divide and conquer technique for merge sorting, first divide the array then sort it then merge it.

Was the last day of my midsem exam, started with dsa as(merge sort). Got to know that we can use divide and conquer technique for merge sorting, first divid

#day2 of #100daysofcode