a greedy algorythm always selects the first choice without needing to look into the future. it is really easy to implement and often works good enough. but an example of where it would not work well is this 
since it does not look into the future it will end up with fewer points than something that looks into the future. it doesnt make the WORST choice, but it is an easy good enough algorthm.