I know how basic binary search works, however i always get stuck with the different variations of binary search. Can someone point me to the good material which can remove all my doubts pretaining to different variations of binary search. Example of one variation is:

1. Finding the floor and ceiling values in sorted array for a given key. (in both case when the key is present or not present).

There are multiple other variations as well.