leaner search scan entire table record by record, binary search algorithm continues by dividing the entire data as two halves and continue this process until the exact record found but can any body tell me how the standard hash algorithm works? does it designed to use same leaner or binary search or else any special way?
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.