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).
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.
git clone https://github.com/gangula-karthik/NYP_DSA_ASSIGNMENT.git
Sierpinski Triangle |
---|
![]() |
Sierpinski Circle |
![]() |
Sierpinski Carpet |
![]() |