{"id":19880111,"url":"https://github.com/silent0wings/oddonacci-sequence-calculations","last_synced_at":"2026-05-13T17:40:10.143Z","repository":{"id":253206325,"uuid":"842806726","full_name":"Silent0Wings/Oddonacci-Sequence-Calculations","owner":"Silent0Wings","description":"This project implements two methods for calculating Oddonacci numbers using Java: a linear tail-recursive approach and a multiple recursive approach. These methods are implemented to study their performance in terms of execution time and efficiency.","archived":false,"fork":false,"pushed_at":"2024-08-15T06:05:32.000Z","size":82,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-11T17:55:03.703Z","etag":null,"topics":["algorithm","algorithm-design","coding-practice","computational-math","fibonacci-variant","java","math-algorithms","math-functions","mathematics","number-sequences","oddonacci-sequence","programming","recursion","sequence-calculation","sequence-generation"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Silent0Wings.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-08-15T06:02:04.000Z","updated_at":"2024-11-02T20:36:16.000Z","dependencies_parsed_at":"2024-08-15T07:51:10.511Z","dependency_job_id":null,"html_url":"https://github.com/Silent0Wings/Oddonacci-Sequence-Calculations","commit_stats":null,"previous_names":["silent0wings/oddonacci-sequence-calculations"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FOddonacci-Sequence-Calculations","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FOddonacci-Sequence-Calculations/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FOddonacci-Sequence-Calculations/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FOddonacci-Sequence-Calculations/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Silent0Wings","download_url":"https://codeload.github.com/Silent0Wings/Oddonacci-Sequence-Calculations/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241309104,"owners_count":19941725,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","algorithm-design","coding-practice","computational-math","fibonacci-variant","java","math-algorithms","math-functions","mathematics","number-sequences","oddonacci-sequence","programming","recursion","sequence-calculation","sequence-generation"],"created_at":"2024-11-12T17:10:17.699Z","updated_at":"2026-05-13T17:40:10.112Z","avatar_url":"https://github.com/Silent0Wings.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Oddonacci Sequence Calculations\n\n## Project Overview\nProject Repport .[here](https://github.com/Silent0Wings/Oddonacci-Sequence-Calculations/blob/6cc48b494cb479e8351a28f720fa466c6bb1a380/Github.pdf).\n\n\nThis project implements two methods for calculating Oddonacci numbers using Java: a linear tail-recursive approach and a multiple recursive approach. These methods are implemented to study their performance in terms of execution time and efficiency.\n\n## Code Structure\n\n### Packages and Imports\n- **Package**: `L_Oddonacci`\n- **Imports**: `java.math.BigInteger` for handling large numbers, `java.io` classes for file operations.\n\n### Main Class: `Linear_Oddonacci`\n- **Methods**:\n  - `main(String[] args)`: Entry point to run tests and method executions.\n  - `MultipleOddonacci_Run(int numRuns)`: Executes the multiple recursive Oddonacci calculation multiple times to measure performance.\n  - `LinearTailRecursiveOddonacci_Run(int numRuns)`: Executes the linear tail-recursive Oddonacci calculation.\n  - `Full_Test(int numRuns)`: Runs both methods for a series of inputs to compare outputs directly.\n  - `LinearTailRecursiveOddonacci(int n, BigInteger a, BigInteger b, BigInteger c)`: Calculates Oddonacci using tail recursion.\n  - `MultipleOddonacci(int n, BigInteger first, BigInteger second, BigInteger third)`: Calculates Oddonacci using multiple recursion.\n  - `ArrayToFile(int[] input, BigInteger[] Data, long[] time, String FuncName, String Path)`: Saves results to a file.\n\n### Algorithm Descriptions\n1. **Linear Tail-Recursive Oddonacci**\n   - Tail recursion optimizes memory usage by reducing the need for new stack frames for each recursive call.\n   - Example execution: Calculates efficiently by updating the last three computed values recursively.\n   \n2. **Multiple Recursive Oddonacci**\n   - Utilizes multiple recursive calls, increasing the computation exponentially with each step.\n   - Less efficient for larger inputs due to increased computational overhead.\n\n### Usage\n- Compile and run the `Linear_Oddonacci` class.\n- Methods can be called with varying `numRuns` to see performance impacts directly.\n- Results of performance tests are written to text files, allowing for easy analysis of execution times.\n\n### Performance Analysis\n- Execution times and Oddonacci values are recorded.\n- Performance is analyzed by comparing the efficiency of linear tail recursion versus multiple recursion.\n\n## Files and Output\n- Results are saved to `MultipleOddonacci.txt` and `LinearOddonacci.txt` files, detailing the input, computed Oddonacci number, and execution time for each test.\n\n## Contributing\n- Enhancements to the recursion methods or new approaches to Oddonacci number calculations are welcome.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsilent0wings%2Foddonacci-sequence-calculations","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsilent0wings%2Foddonacci-sequence-calculations","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsilent0wings%2Foddonacci-sequence-calculations/lists"}