Skip to content

Unleashing fractal beauty and algorithmic efficiency—solving classic patterns and problems with precision 📐 🟦 🔴

Notifications You must be signed in to change notification settings

gangula-karthik/NYP_DSA_ASSIGNMENT

Repository files navigation

NYP DATA STRUCTURES AND ALGORITHMS ASSIGNMENT

This repository contains solutions to 4 programming problems as part of an assignment for the Data Structures and Algorithms (DSA) course at Nanyang Polytechnic (NYP).

Questions Solved

Sierpinski Triangle The program generates the Sierpinski triangle fractal pattern using a recursive algorithm.

Sierpinski Carpet The program generates the Sierpinski carpet fractal pattern using a recursive algorithm.

Sierpinski Circle The program generates the Sierpinski circle fractal pattern using a recursive algorithm.

Efficient Algorithm for TwoSum Problem The program implements an efficient algorithm to find all the pairs of elements in an array that add up to a specified target sum.

Downloading:

git clone https://github.com/gangula-karthik/NYP_DSA_ASSIGNMENT.git

Fractals Demo

Sierpinski Triangle
Untitled
Sierpinski Circle
Untitled2
Sierpinski Carpet
Untitled5

About

Unleashing fractal beauty and algorithmic efficiency—solving classic patterns and problems with precision 📐 🟦 🔴

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Languages