CCCS

$3$

$1$

$5$

: Data Structures and Algorithms

Assignment

$1$

Type of Assignment

Individual Work

Estimated Time:

$1$

$2$

$0$

$$minute

Description

In this Assignment, you will study, Analyze

$($

Big

$-$

O

$)$

$,$

$$and implement a singly Linked List Arrays. You also compare an implementation of a method using recursive programming vs iterative programming.

Learning Outcomes

Recognize the use of the linked

$-$

list and recursive programming

Apply Big

$-$

O notation to analysis of an algorithm