The Divide & Conquer Technique Used In the Analysis and Design of Algorithms

Abstract

Some sorting algorithms are simple and spontaneous, such as the bubble sort. Others, such as the quick sort are enormously complex, but produce superfast results. Some sorting algorithm work on less number of elements, some are suitable for floating point numbers, some are good for specific range, some sorting algorithms are used for huge number of data, and some are used if the list has repeated values. We sort data either in statistical order or lexicographical, sorting numerical value either in increasing order or decreasing order and alphabetical value. The complexity of algorithmic is generally written in a form known as Big – O (n) notation, where the O represents the complexity of the algorithm and a value n represents the size of the set the algorithm is run against. The two groups of sorting algorithms are O(), which includes the bubble, insertion, selection, and shell sorts, and O(n log n) which includes the heap, merge, and quick sort. Since the advancement in computing, much of the research is done to solve the sorting problem, perhaps due to the complexity of solving it efficiently despite its simple, familiar statement. It is always very difficult to say that one sorting algorithm is better than another. Performance of various sorting algorithms depends upon the data being sorted.

Authors and Affiliations

Shivangi Shandilya, Surekha Sangwan, Ritu Yadav

Keywords

Related Articles

Secured Login Authentication on Key Attackers

An innovative solution is proposed to avoid the problem such as password security at application layer. For password security all lower case characters, upper case characters, special characters and digits in password c...

slugIntelligent Data Mining Techniques in Cancer Disease Pattern Detection

Technology plays a very crucial role for healthcare. Information technologies provides computerized patients records, computerized decision and support tools, computer based hospital information, telemedici...

Review on Design Approach for Dual Frequency Patch Antennas

In numerous applications, operation in two distinct frequency bands which are far apart from each other is required. Here dual band antennas are used instead of broadband antennas. Also, dual-frequency patch antenna avo...

Automated Malaria Detection from Blood Samples Using Image Processing

Malaria is a life-threatening parasitic disease, caused by the protozoan parasites of the genus Plasmodium and is transmitted through the bite of a female Anopheles mosquito. During this process, the red blood cells (RB...

A review on Drowsiness and Alcohol Detection for car assisted driver System

This paper provides an overview of existing system of real time detection of car driver drowsiness and alcoholic intoxication. Now a day, there are large numbers of road accidents are takes places due to Drowsiness or a...

Download PDF file
  • EP ID EP20245
  • DOI -
  • Views 442
  • Downloads 4

How To Cite

Shivangi Shandilya, Surekha Sangwan, Ritu Yadav (2015). The Divide & Conquer Technique Used In the Analysis and Design of Algorithms. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 3(4), -. https://europub.co.uk/articles/-A-20245