|
-
How to implement binary search
I have a text file containing several words and pointers, like this:
String1 int1
String2 int2
String3 int3
......
The String1, String2, String3......are sorted in lexicographical order.
What I want to do is to search a word among those Strings, using binary search, and return the int value beside the matched String.
Could anybody give me some detailed help on this question? Thanks in advance.
Similar Threads
-
Replies: 0
Last Post: 01-30-2006, 02:56 PM
-
Replies: 1
Last Post: 12-17-2005, 02:50 PM
-
Replies: 0
Last Post: 10-23-2001, 11:21 AM
-
By Tom in forum VB Classic
Replies: 0
Last Post: 12-02-2000, 12:24 PM
-
Replies: 0
Last Post: 12-02-2000, 12:08 PM
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
Forum Rules
|
Top DevX Stories
Easy Web Services with SQL Server 2005 HTTP Endpoints
JavaOne 2005: Java Platform Roadmap Focuses on Ease of Development, Sun Focuses on the "Free" in F.O.S.S.
Wed Yourself to UML with the Power of Associations
Microsoft to Add AJAX Capabilities to ASP.NET
IBM's Cloudscape Versus MySQL
|
Bookmarks