Two sum: Difference between revisions

→‎{{header|zkl}}: still waking up
(→‎{{header|zkl}}: re factor)
(→‎{{header|zkl}}: still waking up)
Line 82:
The sorted O(n) no external storage solution:
<lang zkl>fcn twoSum(sum,ns){
mi,j:=0,ns.len()/2-1;
while(i<j){
foreach i,j in (m,[ns.len()-1..m,-1]){ // make sure to see middle number
if(ns[i] + ns[j] == sum) return(i,j);
i+=1; j-=1;
}
}</lang>
Anonymous user