Skip to main content

Sorting Techniques In Data Structure

     ⇰  SORTING :-

 In our day-to-day life there are many things that we need to search for , like any page in book, phone number in directory, any record in database etc.  All these  would have been mixed up if these data was kept unordered and unsorted. For this purpose fortunately the concept of sorting is introduced. Sorting makes easier for everyone to arrange any data in an order, hence searching becomes easier. Means sorting arranges data in a sequence or in order which makes searching easier.

⇾ After applying the sorting technique, If the contents do not change the sequence of similar content in which they appear, it is called stable sorting technique.
⇾ After applying the sorting technique, if  the contents do change the sequence of similar content in which they appear, it is called unstable sorting technique.

    ⇰  SORTING ORDERS :-
⇾ Basically all sorting techniques sorts the given data in following orders :- 
 i > Increasing Order :- The order of data is  said to be in increasing order, if the successive element is greater than the previous element. For example, 1, 2, 5, 6, 8, 9 are in increasing order, as every next element is greater than the previous element.
ii > Decreasing Order :- The order of data is said to  be in decreasing order, if the successive element is less than the current element. For example, 11, 9, 6, 3, 1 are in decreasing order, as every next element is less than the previous element.

⇰  DIFFERENT SORTING TECHNIQUES :-
There are many different types of sorting techniques available. All of them are differentiated by their efficiency. Some of Sorting techniques are as follows which we will discuss in upcoming posts seperately :-
∘ Insertion sort.
∘ Selection Sort.
∘ Bubble Sort..
Click on the type of sorting technique above to get direct link of that technique.


Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above.
Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

Process & Its state And process control block :-

                ⇰  PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution.             A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads.         The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two ...
Post a Comment
Read more

Process Scheduling And Types of Process Schedular :-

        ⇰ PROCESS SCHEDULING Process Scheduling  is a task  of Operating System that schedules processes of different states like new, ready, waiting, terminated  and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time.  ⏩   Followings are some objectives of Process Scheduling :-  i > To increase the amount of users within acceptable response times.  ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and  give reference to the processes holding the key resources.      ⇰  PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and  allows multiple users to shar...
8 comments
Read more

Atomic Transaction In Operating System

All the synchronization techniques we have studied are essentially low level as like semaphores. They require the programmer to involved with all the details of mutual exclusion, critical region management, deadlock prevention, and crash recovery. An abstraction exists there  and is widely used in distributed systems. We will call it an  atomic transaction,  or simply  transaction.   The term  atomic action  is also widely used. The mutual exclusion of critical section ensures that the critical sections are executed automatically. That is, if two critical sections are executed concurrently, the result is equivalent to their sequential execution in some unknown order.   In many cases we would like to make sure that a critical section forms a single logical unit of work that either is performed in its entirely or is not performed at all. An example is funds transfer, in which one account is debited and another is credited. Clearly, it is essential f...
Post a Comment
Read more