0% found this document useful (0 votes)
4 views2 pages

Sorting

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views2 pages

Sorting

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

SORTING ALGORITHM

Sorting is the act of arranging data in ascending or descending order based on linear
relationships among data items.

Organizing data into a specific format is called sorting. Sorting algorithms specify the order
in which data are arranged. Usually, data are ordered numerically or alphabetically.

In data structures, sorting refers to the arrangement of data in a preferred order. Sorting data
allows a user to find information faster and easier. A dictionary is a simple example of
sorting.

Why Sorting Is Important

Sorting is becoming more and more important as data search can be optimized to an
extremely high degree if data is stored in a sorted manner. Data can also be arranged in a
more readable manner when sorted.

Types of Sorting Techniques


There are various sorting algorithms are used in data structures. The following two types of
sorting algorithms can be broadly classified:
1. Comparison-based: We compare the elements in a comparison-based sorting
algorithm)
2. Non-comparison-based: We do not compare the elements in a non-comparison-
based sorting algorithm)

Notes compiled by:


Sangita Vishwakarma
DPGITM
Notes compiled by:
Sangita Vishwakarma
DPGITM

You might also like