Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
474 Programming and Data Structures
Enter eight elements: 12 34 54 76 69 78 85 97
Enter an element: 3
The element 3 is not found in list
Explanation In the above program eight elements are entered. The user has to enter an element
whose predecessor and successor are to be identified. All the elements of the array are checked with
the entered number. When the match is found, the next element of the entered number is displayed
as successor and the previous element is displayed as predecessor. If the element entered is the first
element of the list then only successor is displayed. If the entered element is the last element of the
list the
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

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343