COUNTING SORT
seminar surveyer Active In SP Posts: 3,541 Joined: Sep 2010 
13012011, 11:57 AM
Abstract Counting sort is a linear time sorting algorithm used to sort items when they belong to a fixed and finite set. Integers which lie in a fixed interval, say k1 to k2, are examples of such items. The algorithm proceeds by defining an ordering relation between the items from which the set to be sorted is derived (for a set of integers, this relation is trivial).Let the set to be sorted be called A. Then, an auxiliary array with size equal to the number of items in the superset is defined, say B. For each element in A, say e, the algorithm stores the number of items in A smaller than or equal to e in B(e). If the sorted set is to be stored in an array C, then for each e in A, taken in reverse order, C[B[e]] = e. After each such step, the value of B(e) is decremented. Counting sort is a stable sort and has a running time of Θ(n+k), where n and k are the lengths of the arrays A (the input array) and C (the counting array), respectively. In order for this algorithm to be efficient, k must not be much larger than n. The indices of C must run from the minimum to the maximum value in A to be able to index C directly with the values of A. Otherwise, the values of A will need to be translated (shifted), so that the minimum value of A matches the smallest index of C. (Translation by subtracting the minimum value of A from each element to get an index into C therefore gives a counting sort. If a more complex function is used to relate values in A to indices into C, it is a bucket sort.) If the minimum and maximum values of A are not known, an initial pass of the data will be necessary to find these. Read more: http://en.wikipedia.org/wiki/Counting_sort http://cse.iitk.ac.in/users/dsrkg/cs210/...count.html http://personal.kent.edu/~rmuhamma/Algor...ngSort.htm 


Annapurna pulipati Active In SP Posts: 2 Joined: Jan 2011 
20012011, 07:17 PM
send complete seminar and presentation



seminar surveyer Active In SP Posts: 3,541 Joined: Sep 2010 
22012011, 12:10 PM
sorry yaar
i couldn't find a complete report here. why don't you visit the links given? those should have complete details i hope. 



Important Note..!
If you are not satisfied with above reply ,..PleaseASK HERE
So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this pagePossibly Related Threads...  
Thread  Author  Replies  Views  Last Post  
Insertion Sort PPT  study tips  0  361 
19022013, 10:15 AM Last Post: study tips 

Seminar on Topological Sort pdf  project girl  0  323 
10122012, 12:35 PM Last Post: project girl 

IMPLEMENTATION OF TOPOLOGICAL SORT  seminar tips  0  311 
15112012, 04:31 PM Last Post: seminar tips 

Radix Sort  seminar ideas  1  624 
28082012, 05:07 PM Last Post: seminar flower 

Bubble Sort  seminar flower  0  366 
27072012, 02:12 PM Last Post: seminar flower 

Quick Sort in Java  seminar flower  0  446 
18072012, 03:36 PM Last Post: seminar flower 

algorithm,Analysis of INSERTION SORT,Hiring Problem,Quicksort,knapsack problem,Greedy  project report helper  0  2,110 
20102010, 10:47 AM Last Post: project report helper 