Algorithms to live by -The optimal stopping problem
I have read about this book for a while now, before I have chosen to read it , it is about some algorithms that may have encountered most of us with some algorithms that may be helpful to solve them, so this pots would be mainly some brief notes about it. for example the main hiring dilemma, when should we stop interviewing candidates and get the best so far, the same goes for the finding an apartment , or even for marriage seeking !!!. all of these had the same problems, that we may stop early so we are missing a better candidate/apartment that we have not see yet, or we can stop late , meaning we have already met the best candidate/seen the best apartment but we have bypassed this one in hope of finding a better candidate/apartment. The optimal strategy is to find the balance between the two, which was introduced as look then leap rule, you do not choose anyone no matter how good/impressive are they . Then you are in the leap phase where you are to choose anyon...