Completeness: Yes, if the search space is finite (m is finite) Optimality: No, recall the greedy algorithm that it always finds a local optimal path which might not be global optimal solution