Description: 1, describes the problem: one pile a total of m gold coins, each coin are positive upward. Check the top one, turn them back into the original position after the noodle, then check the top two coins and put them together and then turned back into the original noodle. Re-admitted 3, take 4, ..., until the entire pile of coins are handled by the above method. Then again from the top of the pile of coins a start, just repeat the practice. This has been until this pile of coins in each one after another up to date are positive. Must ask whether this is happening? If there is need to make a total of how many times over noodle?
- [fenge] - The use of genetic image segmentation al
File list (Check if you may need any files):
COIN_final.m
Download