Skip to content

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.

Notifications You must be signed in to change notification settings

invicta117/COMP20230_Data_Struc_and_Algorithms_Assignment_1

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

COMP20230: Data Structures & Algorithms Assignment 1

In this project, I explored iterative and recursive techniques to compute the factorial of a number. Tail recursion and non-tail recursion are implemented with runtime and memory usage of each of these techniques explored. Linear search and iterative binary search are also implemented with runtimes and memory usage explored. Big-O for each of these algorithms is examined and discussed. Curve fitting algorithms are also used to demonstrate how each algorithm matches its Big-O runtime.

About

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.

Topics

Resources

Stars

Watchers

Forks