Sorting Technique

                                                                 Sorting Technique

Home

 Sorting is a process of arranging list of element in ascending or descending order.

 Sorting always works on collection of list elements i.e Array, List(java).  We can sort the elements in two different order either ascending or descending. 

 Sorting is the process of placing elements from a collection in some kind of order. For example, a list of words could be sorted alphabetically or by length. A list of cities could be sorted by population, by area, or by zip code. 

 Binary Search will always works on Sorted elements. 

 Before getting into specific algorithms, we should think about the operations that can be used to analyze a sorting process. First, it will be necessary to compare two values to see which is smaller (or larger). In order to sort a collection, it will be necessary to have some systematic way to compare values to see if they are out of order. The total number of comparisons will be the most common way to measure a sort procedure. Second, when values are not in the correct position with respect to one another, it may be necessary to exchange them. This exchange is a costly operation and the total number of exchanges will also be important for evaluating the overall efficiency of the algorithm.

 Below are the some important sorting  technique...

1) Insertion sorting
2) Selection sorting
3) Radix sorting
4) Bubble sorting
5) Merge sorting
6) Shell sort
****
I will update very soon all mentioned sorting technique with java example. 
Thanks,


Comments

Post a Comment

Popular posts from this blog

Insertion Sort

Image
                                                                     Insertion Sort This is very easy technique to arrange the list of elements either in ascending or descending order. Insertion sort algorithm arranges a list of elements in a particular order. In insertion sort algorithm, every iteration moves an element from unsorted portion to sorted portion until all the elements are sorted in the list. The insertion sort algorithm is performed using following steps... Step 1:  Assume that first element in the list is in sorted portion of the list and remaining all elements are in unsorted portion. Step 2:  Consider first element from the unsorted list and insert that element into the sorted list in order specified. Step 3:  Repeat the above process until all the elements from the unsorted list are moved into the sorted list. Lets see how it works: Insertion sort start's sorting an array by picking 1st element of array. (We begin by assuming that
Read more
                                         Advantage of Web services Home Exposing the existing function on to network: A  Web service  is a unit of managed code that can be remotely invoked using HTTP, that is, it can be activated using HTTP requests. So,  Web Services  allows you to expose the functionality of your existing code over the network. Once it is exposed on the network, other application can use the functionality of your program. Connecting Different Applications ie Interoperability: Web Services allows different applications to talk to each other and share data and services among themselves. Other applications can also use the services of the web services. For example VB or .NET application can talk to java web services and vice versa. So, Web services is used to make the application platform and technology independent. Standardized Protocol: Web Services uses standardized industry standard protocol for the communication. All the four layers (Service Tran
Read more

What is Selection Sort? And how it works?

Image
Click here for more contents Selection Sort Selection Sort algorithm is used to arrange a list of elements in a particular order (Ascending or Descending). In selection sort, the first element in the list is selected and it is compared repeatedly with remaining all the elements in the list. If any element is smaller than the selected element (for Ascending order), then both are swapped. Then we select the element at second position in the list and it is compared with remaining all elements in the list. If any element is smaller than the selected element, then both are swapped. This procedure is repeated till the entire list is sorted. The selection sort algorithm is performed using following steps... Step 1:  Select the first element of the list (i.e., Element at first position in the list). Step 2:  Compare the selected element with all other elements in the list. Step 3:  For every comparision, if any element is smaller than selected element (for Ascending order), then
Read more