Update

Author: alishohadaee

README.md

@@ -89,3 +89,6 @@ In this algorithm, we have a initial state, we look for its neighbors and we cho
 5. Compare this neighbor's value with the current state's value
 6. If the value is better, choose this neighbor as the current neighbor
 e.	Else, we are in the local maximum, and in our problem, the solution for this local maximum is to starting again from a random state.
+
+# Refrences
+Slides and notations were adopted from my teacher, [Doctor Nooshin Maghsoodi](https://www.linkedin.com/in/nooshin-maghsoodi-7b76261b8?lipi=urn%3Ali%3Apage%3Ad_flagship3_profile_view_base_contact_details%3BfAiHZMkOS3qh%2BHYywIgOXA%3D%3D)