Consider the alphabetized linear array DICTIONARY in figure below: How many words that must be pushed or
Fantastic news! We've Found the answer you've been seeking!
Question:
Consider the alphabetized linear array DICTIONARY in figure below:
- How many words that must be pushed or moved if B,J and P which are new words are inserted in to DICTIONARY at three different places?
- How many words are to be moved or shifted to a new locations if new three words are inserted in the DICTIONARY simultaneously at a time?
- What do you think that how a publisher handles the insertion process in the DICTIONARY?
- If we are Using Linear Search Algorithm How many comparisons C and swaps S of the words are to be made to locate the Words H,M and F? Specify the criteria for unsuccessful search (Where and the searching process stops)?
- Let the binary searching algorithm is applied on DICTIONARY to find and locate the word G .
- At this point what is the value of BEG ,END and MID variables?
Related Book For
Fundamentals of Physics
ISBN: 978-0471758013
8th Extended edition
Authors: Jearl Walker, Halliday Resnick
Posted Date: