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
Determine YIQ Colour Model Whereas an RGB monitor requires separate signals for the red, green, and blue components of an image, a television monitor uses a single composite si

Double ended queues are implemented along doubly linked lists. A doubly link list can traverse in both of the directions as it contain two pointers namely left pointers and righ

This section prescribes additional exercise with the recursive and iterative handling of a binary search tree. Adding to the Binary Search Tree Recursively Add implementation

Midsquare Method :- this operates in 2 steps. In the first step the square of the key value K is taken. In the 2nd step, the hash value is obtained by deleting digits from ends of

The class Element represents a single node that can be part of multiple elements on a hotplate and runs in its own thread. The constructor accepts the initial temperature and a hea

Write an algorithm for getting solution to the Tower's of Hanoi problem. Explain the working of your algorithm (with 4 disks) with appropriate diagrams. Ans: void Hanoi(int

Define the term - Array A fixed length, ordered collection of values of same type stored in contiguous memory locations; collection may be ordered in several dimensions.

Q. Define the graph, adjacency matrix, adjacency list, hash function, adjacency matrix, sparse matrix, reachability matrix.


Q. Explain Dijkstra's algorithm for finding the shortest path in the graph given to us.  Ans: The Dijkstra's algorithm: This is a problem which is concerned with finding