Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
Arrays: Searching and Sorting 119
However if the list is already sorted in the ascending order, no copy operations would be required. It
becomes the best case and the algorithm will have only N comparisons, i.e., a linear running time.
3.2.5.7 Merge Sort This method uses following two concepts:
(1) If a list is empty or it contains only one element, then the list is already sorted. A list that con-
tains only one element is also called singleton.
(2) It uses the old proven technique of
divide and conquer to recur-
sively divide the list into sub-lists
until it is left with either empty or
singleton lists.
In fact, this algorithm divi ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582