Andere Kunden interessierten sich auch für
![Optimizing Wood Drying]( "Optimizing Wood Drying")
Optimizing Wood Drying36,99 €![How To Earn Your ¿First Million Through Divide and Conquer Strategy]( "How To Earn Your ¿First Million Through Divide and Conquer Strategy")
How To Earn Your ¿First Million Through Divide and Conquer Strategy10,99 €![The effects of Lifestyles on Consumer Based Brand Equity]( "The effects of Lifestyles on Consumer Based Brand Equity")
The effects of Lifestyles on Consumer Based Brand Equity47,99 €![Challenges and Prospects of VER: The Case of Gulelle Sub-city]( "Challenges and Prospects of VER: The Case of Gulelle Sub-city")
Challenges and Prospects of VER: The Case of Gulelle Sub-city36,99 €![Terrace and Soil Properties: The Case of Anjeni Area, Ethiopia]( "Terrace and Soil Properties: The Case of Anjeni Area, Ethiopia")
Terrace and Soil Properties: The Case of Anjeni Area, Ethiopia36,99 €![Impact of Faith Based Economy on the Church and National Development]( "Impact of Faith Based Economy on the Church and National Development")
Impact of Faith Based Economy on the Church and National Development29,99 €![RADIO MESSAGES AND THE FIGHT AGAINST GENDER-BASED VIOLENCE (GvB)]( "RADIO MESSAGES AND THE FIGHT AGAINST GENDER-BASED VIOLENCE (GvB)")
RADIO MESSAGES AND THE FIGHT AGAINST GENDER-BASED VIOLENCE (GvB)29,99 €
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 systems used in the divide and conquer approach. In particular, heap on ternary tree does indicate some theoretical advantages over the more established binary systems. The paper also makes an endeavour to present a set of simulations with random numbers for both integers and floating point numbers to support our theoretically proven claim. For doing so, at first algorithm for conventional binary heapsort has been modified for three and four child heapsort. Thereafter, the paper finds out number of comparisons required, number of movements required and time taken for all the three systems.