Data

Tools

Indexes

Applications

Experiments

Repos

An open API service providing repository metadata for many open source software ecosystems.

GitHub / invicta117 / COMP20230_Data_Struc_and_Algorithms_Assignment_1

This project focuses on computing the factorial of a positive integer n using iteration, tail and non-tail recursion. Searching using linear search and iterative binary. Big-O for each is explored.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/invicta117%2FCOMP20230_Data_Struc_and_Algorithms_Assignment_1

Stars: 1
Forks: 0
Open issues: 0

License: None
Language: Jupyter Notebook
Size: 561 KB
Dependencies parsed at: Pending

Created at: over 3 years ago
Updated at: about 3 years ago
Pushed at: over 3 years ago
Last synced at: about 2 years ago

Topics: algorithms, big-o, binary-search, data-structures, factorial, linear-search, python3, recursion, tail-recursion

    Loading...