很簡單的麵試問題

這幾天我們在麵試candidate for a sr. .net developer. 我們問了這樣一個問題：

Given a sorted array of integers like:

[1, 3, 4, 7, 11, 14, 15, 19, 21].

 

Please complete the following function that searches for an integer in the array and returns the position if the number is found or -1 if not found:

 

int FindNumber(int[] array, int n)

{

    ......

}

 

No candidate has finished the function to our expection.  

看上去很簡單的問題嗎？

所有跟帖： 

• binary search, is it the expectation? -胡說之- ♂ (0 bytes) () 12/06/2012 postreply 12:26:31

• yes, thanks. -布衣之才- ♂ (82 bytes) () 12/06/2012 postreply 12:42:02

• Shouldn't the array be sorted first before doing a binary search -ZhuZhuXia- ♀ (0 bytes) () 12/06/2012 postreply 12:53:24

• no, that was not what we wanted to test. -布衣之才- ♂ (458 bytes) () 12/06/2012 postreply 13:11:54

• 回複：no, that was not what we wanted to test. -布衣之才- ♂ (162 bytes) () 12/06/2012 postreply 21:23:22

• 回複：很簡單的麵試問題 -maymayw- ♀ (99 bytes) () 12/06/2012 postreply 12:32:43