Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

Register Log in
  • Congratulations SkipVought on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!

question on binary search

Status
Not open for further replies.
anatazi

anatazi

Programmer
Jun 24, 2002
33
0
0
US
Hi all,
Which version of bianry search is better? the forgetful version or the one that terminates as soon as the value is found.
Also , can anyone explain to me how comb sort works?
Thanks,
 
Sort by date Sort by votes
Don't really know what you mean by the 'forgetful' version. In a binary search, all the items are assumed to be in some sort of order. Then it is just a matter of dividing the blocks into two until the item is found.

comb sort is new to me. Never heard of this one before. Do you have a URL for it?
 
Upvote 0 Downvote
Status
Not open for further replies.

Similar threads

Ethan1812
  • Locked
  • Question
Reading a number from a file and adding another number onto the file. 1
Replies
2
Views
73
Ethan1812
Ethan1812
AIXSolarisAdmin
  • Locked
  • Question
While sending a file I am only gett
Replies
0
Views
57
AIXSolarisAdmin
AIXSolarisAdmin
vinoth124
  • Locked
  • Question
Query in memory issue on C code in AIX server
Replies
2
Views
66
xwb
xwb
gismo
  • Locked
  • Question
Multihread ansi C in visual Studio 6 on windows 7 1
Replies
1
Views
58
xwb
xwb
aakafh
  • Locked
  • Question
Array question 1
Replies
4
Views
51
ArkM
ArkM

Part and Inventory Search

Sponsor

Back
Top