We implemented typical algorithms for sorting and searching in C# to prepare for the Basic Information Technology Engineer exam.
- Compare [i] with the value you are looking for
- If there is a match, the search is completed. If there is no match, increase the value of i by one.
- The search continues until the desired value is matched. If the desired value is not found after searching to the end, the search is terminated.
https://www.jitec.ipa.go.jp/1_13download/syllabus_fe_ver7_2.pdf