Revision as of 11:42, 10 February 2016 (view source) Rdm (talk \| contribs) (→‎Recursive binary search in C) ← Older edit		Revision as of 16:38, 15 December 2017 (view source) rosettacode>Katt (omg) Newer edit →
Line 1: == PARI/GP example == The PARI/GP example, I find it to be insufficient. omg triggered. Lol... WaTcH mEhh cOdE oNe UPPPPPP. I'll derive it from the N/t/roff example. :P By the way, there is a URL somewhere at the bottom and my Internet is literally 56K dialup. So, I have removed that URL out so I won't get that slow-loading CAPTCHA box. I will regret this edit when I'm not a teenager. I promise. Haha! Looks like we created the [[Binary Search\|same task]] around the same time. --[[User:Short Circuit\|Short Circuit]] 23:46, 7 November 2007 (MST) :I guess we did. Sorry for the mess I made initially...it was the first time I made a new page for a task. --[[User:mwn3d\|mwn3d]] 29:21, 8 November 2007 (EST) Line 23 ⟶ 26: == Recursive binary search in C == Is there any reason why <code>n</code> is passed as argument in <code>int bsearch_r (int *a, int n, int x, int i, int j)</code> ~~[http://rosettacode.org/wiki/Binary_search#C in C]~~? --[[User:Natema\|Natema]] ([[User talk:Natema\|talk]]) 05:31, 10 February 2016 (UTC) : I agree with your hint - that parameter does look to be unnecessary. --[[User:Rdm\|Rdm]] ([[User talk:Rdm\|talk]]) 11:42, 10 February 2016 (UTC)

Talk:Binary search: Difference between revisions

Talk:Binary search (view source)