2.5H

SUBMITTED BY: Guest

DATE: Sept. 20, 2014, 12:31 p.m.

FORMAT: Text only

SIZE: 365 Bytes

Raw Download

HITS: 791

Report
  1. int k=0;
  2. int end=len-1;
  3. int start=0;
  4. while(k==0)
  5. {
  6. if(start!=end-2)
  7. {
  9. if(ar[end/2+start/2]>0)
  10. {
  11. if(ar[(end/2+start/2)+1]<0)
  12. {
  13. k=end/2+start/2;
  14. }
  15. start=end/2+(start/2);
  16. }
  17. else
  18. {
  19. end=end/2+(start/2);
  20. }
  21. }
  22. else
  23. {
  24. k=start+1;
  25. }
  26. }
  27. return k;
comments powered by Disqus