all tags:     microsoft   cisco   juniper   sun   intel   amd   nvidia   ati   hp   google   ebay   windriver   amazon   nationalsemi   yahoo   qualitest   goldmansachs   microsft   puzzle   math   sw   programming   general   hw   testing   algorithms   networking   c++   assembly   database   unix   security   java   comparch   architecture   hardware   design   circuit   logic   software   embedded   behavioral   windows   string   sql   perl   shell   structures   aptitude   software/sw   html   web  

First page

Q513: Given a 2-d int array in which the values WILL ALWAYS increase in both directions ie. a[i][n+1]>a[i][n] & a[z+1][y] > a[z][y]. Write a function to find whether a value is within this 2-d array in the fastest way possible.
tags: Microsoft software/sw C

---