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
implementation of fast fourier transforms for non power of 2

Q. Draw a B-tree of order 3 for the sequence of keys written below: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10

Q. Prove the hypothesis that "A tree having 'm' nodes has exactly (m-1) branches".      Ans: A tree having m number of nodes has exactly (m-1) branches Proof: A root

Q. Explain the Hash Tables, Hash function and Hashing Techniques properly?             A n s . H as h Table is explained as follows : A hash table is a data struc

What is a Spanning tree of a graph? A Spanning Tree is any tree having of vertices of graph tree and some edges of graph is known as a spanning tree.

Which data structure is required to change infix notation to postfix notation?    Stack function is used to change infix notation to postfix notatio n

Records are mapped onto a computer store by simply juxtaposing their elements. The address of a component (field) r relative to the origin address of the record r is named the fiel


This is a unit of which targeted on the emerging data structures. Red- Black trees, Splay trees, AA-trees & Treaps are introduced. The learner must explore the possibilities of app

1. What is an expert system and where are they needed? 2. What are the major issues involved in building an expert system?