Funcion Ackerman En Java 5v1z32

ed by: Jhonatan Torres Torres
0
0

May 2022
PDF

This document was ed by and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this report form. Report 2z6p3t

Overview 5o1f4z

& View Funcion Ackerman En Java as PDF for free.

More details 6z3438

Words: 110
Pages: 1

Funcion Ackerman en java (02.03.06) La fusión de Ackerman se define como: Ackerman(m, n) = n + 1 si m = 0 Ackerman(m, n) = Ackerman(m - 1, 1) si m > 0 y n = 0 Ackerman(m, n) = Ackerman(m - 1, Ackerman(m, n - 1)) si m > 0 y n > 0 Con ello se tiene que Ackermann(1, 2) = 4 y Ackermann(3, 2) = 29 // public static long ackerman (int n, int m) {

if (n == 0) return ( m+1 ); else if ( m == 0 ) return ackerman ( n-1, 1); else return ackerman ( n-1, ackerman ( n, m-1 )); }