Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
2Activity
0 of .
Results for:
No results containing your search query
P. 1
Hashing

Hashing

Ratings: (0)|Views: 65|Likes:
Published by Mamta Arora

More info:

Categories:Types, Research
Published by: Mamta Arora on Jan 05, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

04/26/2012

pdf

text

original

 
`
The sequential search algorithm takes time proportional to the data size, i.e,
O(n)
.
`
B
inary search improves on liner search reducing thesearch time to
O(log n)
.
`
W
ith a
BS
T, an
O(log n)
search efficiency can beobtained; but the worst-case complexity is
O(n)
.
 
`
S
uppose that we want to store 10,000 students records(each with a 5-digit ID) in a given container.
·
A
linked list implementation would take
O(n)
time.
·
A
height balanced tree would give
O(log n)
accesstime.
·
U
sing an array of size 100,000 would give
O(1)
access time but will lead to a lot of space wastage.
`
Is there some way that we could get
O(1)
access withoutwasting a lot of space?
x
The answer is
hashing
.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->