Simple Binary search algorithm on sorted array. It is an O(log(n)) algorithm. Can be useful at some situation.
Simple DFS and BFS algorithm which iterates through binary tree.
Dynamic programming intends to solve subproblems of the problem first before returning the solution.
Divide and Conquer intends to divide problem into smallest subproblems and then slowly conquer it