Trabalho 1 de Arquitetura de Computadores - UFPB
Implementação em MIPS da função recursiva Hofstadter Q-sequence, definida como:
a(1) = a(2) = 1; a(n) = a(n-a(n-1)) + a(n-a(n-2)) for n > 2
Referência: https://oeis.org/A005185
-
Notifications
You must be signed in to change notification settings - Fork 0
gosoares/Arquitetura-T1
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
MIPS implementation of Hofstadter Q-sequence
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published