Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort

Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort

Versandfertig in 6-10 Tagen
26,99 €
inkl. MwSt.
PAYBACK Punkte
13 °P sammeln!
The divide and conquer approach is very useful in computer science applications. With this approach a large problem is broken down into small and manageable sub problems and each is solved separately. Then these solutions are combined to give the final solution to the problem. This paper presents a discussion on the divide and conquer based techniques for various sorting algorithm with special emphasis on heap sort. Most divide and conquer approach divides a problem into two sub problems recursively. The research shows that ternary systems are more promising than the more traditional binary sy...