Revision as of 21:48, 2 September 2018 edit Hola q hace12353 (talk \| contribs) 2 edits mNo edit summary Tags: Visual edit Mobile edit Mobile web edit ← Previous edit		Revision as of 21:48, 2 September 2018 edit undo Shellwood (talk \| contribs) Extended confirmed users, New page reviewers, Pending changes reviewers, Rollbackers 428,042 edits m Reverted edits by Hola_q_hace12353 (talk) (HG) (3.4.4) Tags: Huggle Rollback Next edit →
Line 67: ====Articles==== {{Cite journal\|last=Beame\|first=Paul\|last2=Fich\|first2=Faith E.\|date=2002-08-01\|title=Optimal Bounds for the Predecessor Problem and Related Problems\|url=http://www.sciencedirect.com/science/article/pii/S0022000002918222\|journal=Journal of Computer and System Sciences\|volume=65\|issue=1\|pages=38–72\|doi=10.1006/jcss.2002.1822\|doi-access=free\|ref=harv}} .......... ==External links== {{Refbegin}} [[Wikiversity:Uninformed Search Project\|Uninformed Search Project]] at the [[Wikiversity]]. [http://sites.google.com/site/hantarto/quantum-computing/unsorted Unsorted Data Searching Using Modulated Database]. {{Refend}} ~~==E==~~ [[Category:Search algorithms\| ]]

Search algorithm: Difference between revisions