This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Algorithm unknown (int sorted Array A, int start, int end, int key) begin if start = = end && A[start] = = key then return start; else begin int mid = floor( (start + end)/2 ); if key < A[mid] then return unknown(A, start, mid, key) else return unknown(A, mid+1, end, key); end; end....
View Full Document
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.
- Spring '12