ABSTRACT
This chapter presents practices for greedy algorithms as follows: practices for greedy algorithms, greedy choices based on sorted data and greedy algorithms used with other methods to solve p-problems. Greedy algorithms are used to solve optimization problems through a sequence of steps, and to make the choice that looks best at each step. There are two properties for optimization problems that can be solved by greedy algorithms: optimal substructures and the property for greedy choices. In modern-day magic shows, passing through walls is very popular, in which a magician performer passes through several walls in a predesigned stage show. The initial thing to realize is that in an optimal solution, the painting operation is never applied more than once at the same position. Binary Search Tree (BST) is an efficient data structure for searching. In a BST, all the elements of the left subtree are smaller, and those of the right subtree are greater than the root.
