Sorting algorithm, Data Structure & Algorithms

Sorting Algorithm

A sorting algorithm is an algorithm which puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is significant for optimizing the use of other algorithms (like search and merge algorithms) which require input data to be in sorted lists; it is also often helpful for canonicalizing data and for producing human-readable output. More formally, the output have to satisfy two conditions:

1.The output is in non-decreasing order (every element is no smaller than the previous element as per to the desired total order);

2.The output is a permutation (reordering) of the input.

Because the dawn of computing, the sorting problem has attracted a great deal of research, perhaps due to the complexity of solving it efficiently in spite of its simple, familiar statement. For instance, bubble sort .Sorting algorithms are prevalent in introductory computer science classes, in which the abundance of algorithms for the problem provides a gentle introduction to a range of core algorithm concepts, such as big O notation, divide and conquer algorithms, data structures, randomized algorithms, time-space tradeoffs, best, worst and average case analysis, and upper and lower bounds.

Posted Date: 2/15/2013 1:47:08 AM | Location : United States







Related Discussions:- Sorting algorithm, Assignment Help, Ask Question on Sorting algorithm, Get Answer, Expert's Help, Sorting algorithm Discussions

Write discussion on Sorting algorithm
Your posts are moderated
Related Questions
State about the Bit String Carrier set of the Bit String ADT is the set of all finite sequences of bits, including empty strings of bits, which we denote λ. This set is {λ, 0

Explain All-pair shortest-paths problem Given a weighted linked graph (undirected or directed), the all pairs shortest paths problem asks to find the distances (the lengths of

/* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

A spanning tree of any graph is only a subgraph that keeps all the vertices and is a tree (having no cycle). A graph might have many spanning trees. Figure: A Graph

how to convert 12 hour format into 24 hour format using c program

Ask question #Minimum 1Mark each of the following statements as valid or invalid. If a statement is invalid, explain why. a. current ¼ list; b. temp->link->link ¼ NULL; c. trail->l

What do we mean by algorithm? What are the characteristics of a good and relevant algorithm? An algorithm is "a step-by-step procedure for finishing some task'' An algorithm c

An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons

I need help writing a pseudocode for my assignment can anyone help?

The minimum cost spanning tree has broad applications in distinct fields. It represents several complicated real world problems such as: 1. Minimum distance for travelling all o