Binary Search : search, binary, sort

Hall of Fame

1. jkr621,554
2. Infinity08430,705
3. evilrix387,063
4. itsmeandn...345,939
5. mrjoltcola136,370
6. pgnatyuk80,095
7. Zoppo69,160
8. alb6660,430
9. AndyAins...48,452
10. Let_Me_Be48,156
11. trinitrotolu...48,102
12. DanRollins46,461
13. ozo40,128
14. Gideon737,720
15. jaime_oliv...36,480
16. pepr30,816
17. ikework23,327
18. sunnycoder20,168
19. JohnGaby18,796
20. masheik18,698
21. LordOfPo...18,490
22. johnnash...17,769
23. josgood17,000
24. abel16,556
25. Gurudenis16,260

1. jkr7,897,645
2. itsmeandn...2,356,347
3. Infinity081,958,116
4. Axter1,467,234
5. evilrix1,042,001
6. nietod859,677
7. AlexFM732,762
8. DanRollins729,638
9. jaime_oliv...725,383
10. rstaveley524,876
11. grg99392,524
12. efn329,300
13. chensu313,112
14. AlexViroc...263,393
15. Zoppo255,353
16. Salte247,544
17. ikework219,121
18. wayside215,557
19. jhance207,462
20. rajeev_d...207,388
21. ambience183,231
22. AndyAins...183,072
23. sunnycoder180,898
24. bcladd171,128
25. SteH170,387

	[x] Posted via EE Mobile
	Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again.

Question

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

5.8

Binary Search

Asked by thienpnguyen in C++ Programming Language, CYGWIN

Tags: search, binary, sort

Assume I have a sorted array of integer numbers. Now I add a integer number into that array such that it still is in order after adding number .

I know I need to find a position to insert my number . The code as following

int mybseach(int *SortedArray, int numEle, int target )
{
int i;
for( i=0; i< numEle; i++)
if( target <= SortedArray[i] )
break;

return i;
}

However, it is not good because big O is O(n). Now I want to change it to "binary search" . Could someone give me that source code ?

Note :

1. This is not a homework . In fact, I lost my implement for that problem .

2. Because it is a "classical" problem, I don't need the pseudo code . I only need the good source code without bug .

Thank for reading .

View the Solution FREE for 30 Days

	Title
1	Roman Numeral to Decimal : Interview…
2	What is the best way to figure out how…

Binary Search

Asked by thienpnguyen in C++ Programming Language, CYGWIN

Tags: search, binary, sort

About this solution