- Category:
- Data structs
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2012-12-01
- Downloads:
- 0 Times
- Uploaded by:
- 周杨
Description: Calculate the Ackermann function ACK ( m, n ) recursive functions. For m>=0, n>=0, ACK ( m, n ) is defined as: ACK ( 0, n ) =n+1 ACK ( m, 0) =ACK ( m-1,1 ) ACK ( m, n ) =ACK ( m-1, ACK ( m, m-1
To Search:
File list (Check if you may need any files):
ack\ack(original).txt
...\ack(others).txt
...\描述.txt
ack