Greedy algorithm: makes locally optimal choices, hoping for global optimality. Key characteristics: efficient time complexity, may not always produce globally optimal solution unless problem guarantees correctness.