{"id":18267764,"url":"https://github.com/gangula-karthik/nyp_dsa_assignment","last_synced_at":"2025-04-09T02:27:35.593Z","repository":{"id":114009556,"uuid":"585812116","full_name":"gangula-karthik/NYP_DSA_ASSIGNMENT","owner":"gangula-karthik","description":"Unleashing fractal beauty and algorithmic efficiency—solving classic patterns and problems with precision 📐 🟦 🔴","archived":false,"fork":false,"pushed_at":"2023-02-03T01:52:46.000Z","size":52,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-14T20:57:37.081Z","etag":null,"topics":["algorithms-and-data-structures","educational","fractal","fractals","geometry","nanyang-polytechnic","python3","sierpinski-carpet","sierpinski-triangle","simulation"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gangula-karthik.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-01-06T06:19:31.000Z","updated_at":"2024-08-27T14:41:16.000Z","dependencies_parsed_at":null,"dependency_job_id":"e376ad38-02fd-44aa-9461-f1af22cf1bd7","html_url":"https://github.com/gangula-karthik/NYP_DSA_ASSIGNMENT","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gangula-karthik%2FNYP_DSA_ASSIGNMENT","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gangula-karthik%2FNYP_DSA_ASSIGNMENT/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gangula-karthik%2FNYP_DSA_ASSIGNMENT/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gangula-karthik%2FNYP_DSA_ASSIGNMENT/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gangula-karthik","download_url":"https://codeload.github.com/gangula-karthik/NYP_DSA_ASSIGNMENT/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247964534,"owners_count":21025210,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms-and-data-structures","educational","fractal","fractals","geometry","nanyang-polytechnic","python3","sierpinski-carpet","sierpinski-triangle","simulation"],"created_at":"2024-11-05T11:28:47.815Z","updated_at":"2025-04-09T02:27:35.561Z","avatar_url":"https://github.com/gangula-karthik.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# NYP DATA STRUCTURES AND ALGORITHMS ASSIGNMENT\n\nThis repository contains solutions to 4 programming problems as part of an assignment for the Data Structures and Algorithms (DSA) course at Nanyang Polytechnic (NYP).\n\n## Questions Solved\n  Sierpinski Triangle\n    The program generates the Sierpinski triangle fractal pattern using a recursive algorithm.\n  \n  Sierpinski Carpet\n    The program generates the Sierpinski carpet fractal pattern using a recursive algorithm.\n  \n  Sierpinski Circle\n    The program generates the Sierpinski circle fractal pattern using a recursive algorithm.\n    \n  Efficient Algorithm for TwoSum Problem\n    The program implements an efficient algorithm to find all the pairs of elements in an array that add up to a specified target sum.\n    \n    \n## Downloading: \n   ```\n   git clone https://github.com/gangula-karthik/NYP_DSA_ASSIGNMENT.git\n   ```\n   \n## Fractals Demo\n\n| Sierpinski Triangle |\n| --- |\n| ![Untitled](https://user-images.githubusercontent.com/56480632/215968260-13f67a24-27d2-4988-844b-bd1a61a6b16a.gif) |\n| Sierpinski Circle |\n| ![Untitled2](https://user-images.githubusercontent.com/56480632/215968459-696d52e3-4219-4f4d-bc31-e920200af341.gif) | \n| Sierpinski Carpet |\n|![Untitled5](https://user-images.githubusercontent.com/56480632/215970776-7ea98782-9ccf-449d-a88c-9fc3123ef651.gif) |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgangula-karthik%2Fnyp_dsa_assignment","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgangula-karthik%2Fnyp_dsa_assignment","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgangula-karthik%2Fnyp_dsa_assignment/lists"}