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
86 Data Structures Using C
As a first step, it is understandable that an algorithm would be fast for a small input data. For
example, the search for an item in a list of 10 elements would definitely be faster as compared to
searching the same item within a list of 1,000 elements. Therefore, the execution time T of an algo-
rithm has to be dependent upon N, the size of input data. Now the question is how to measure the
execution time T. Can we exactly compute the execution time? Perhaps not because there are many
factors that govern the actual execution of program in a computer system. Some of the important
factors are listed below:
n The speed ...
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