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
Decision Tree A decision tree is a diagram that shows conditions and actions sequentially and therefore shows which condition is to be considered first, second and so on. It is

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Demonstration of Polynomial using Linked List # include # include Struct link { Char sign; intcoef; int expo; struct link *next; }; Typedefstruct link

how to write prims algorithms? with example

write an algorithm for multiplication of two sparse matrices using Linked Lists

Write an assembly program to separate the number of positive numbers and negative numbers from a given series of signed numbers.


N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

Write the algorithm for compound interest

how I can easily implement the bubble,selection,linear,binary searth algorithms?