{"id":25002230,"url":"https://github.com/pprattis/sparse-matrices-addition-and-sub-matrices","last_synced_at":"2025-03-29T20:44:20.987Z","repository":{"id":194622030,"uuid":"215557774","full_name":"pprattis/sparse-matrices-addition-and-sub-matrices","owner":"pprattis","description":"A program that applies some functions on sparse matrices. First addition between two sparse matrices and secondly finding any 2x2 sub-matrix in which the sum of all 4 elements are greater than a variable c.","archived":false,"fork":false,"pushed_at":"2020-01-06T13:52:52.000Z","size":51,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-04T21:44:17.864Z","etag":null,"topics":["2darrays","cpp","exercise","linked-list","programm","sparse-matrices","student","subarray","timecomplexity"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pprattis.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2019-10-16T13:40:28.000Z","updated_at":"2020-01-06T13:52:54.000Z","dependencies_parsed_at":"2023-09-14T10:27:49.395Z","dependency_job_id":null,"html_url":"https://github.com/pprattis/sparse-matrices-addition-and-sub-matrices","commit_stats":null,"previous_names":["peteprattis/sparse-matrices-addition-and-sub-matrices","pprattis/sparse-matrices-addition-and-sub-matrices"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pprattis%2Fsparse-matrices-addition-and-sub-matrices","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pprattis%2Fsparse-matrices-addition-and-sub-matrices/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pprattis%2Fsparse-matrices-addition-and-sub-matrices/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pprattis%2Fsparse-matrices-addition-and-sub-matrices/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pprattis","download_url":"https://codeload.github.com/pprattis/sparse-matrices-addition-and-sub-matrices/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246243567,"owners_count":20746307,"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":["2darrays","cpp","exercise","linked-list","programm","sparse-matrices","student","subarray","timecomplexity"],"created_at":"2025-02-04T21:40:23.922Z","updated_at":"2025-03-29T20:44:20.961Z","avatar_url":"https://github.com/pprattis.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# A C++ Project\n\n**This is a simple C++ project from my early days as a Computer Science student**\n\n_This programm was created for the second semester class Data Structures \nand is one of two such simple C++ programms neccessary to pass the class_\n\n\n\u003e #### Description of project (2 exercises)\n\u003e\n\u003e\u003eExercise one is addition of two sparse tables / matrices. The implementation of the addition of tables should have a time complexity \nof Θ(nA + nB) where nA and nB are the number of non-zero elements of tables A and B. Also I minimize the total space necessary for \nimplementing the addition of tables. Ideally, this program should use Θ(nC) space where nC is the number of non-zero elements\nof the result table C. Finally, the program prints table C in its two-dimensional form, including its zero elements.\n\u003e\n\u003e\u003eExercise two is a program that returns a 2X2 sub table (if any) from table A, whose sum of elements is greater than a variable c. \nFor example if c = 80 then the program should return the sub array\u003cbr\u003e\n[0 20]\u003cbr\u003e\n[30 40] \n\u003e\n\n\u003e #### Implementations (2 ways)\n\u003e\n\u003e i. The first implementation uses linked-lists to reduce size and time complexity\u003cbr\u003e\n\u003e ii. The second implementation uses 2D arrays\n\u003e\n\n\u003e #### Functionality\n\u003e\n\u003e 1. User can choose to run between the two exercises for both implementations\n\u003e 2. User can choose betwwen randomly or manually creating arrays for both exercises for both implementations\n\u003e\n\n\u003e #### About this project\n\u003e\n\u003e - The comments to make the code understandable, are within the archives\n\u003e - This program was written in CodeBlocks\n\u003e - This repository was created to show the variety of the work I did and experience I gained as a student\n\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpprattis%2Fsparse-matrices-addition-and-sub-matrices","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpprattis%2Fsparse-matrices-addition-and-sub-matrices","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpprattis%2Fsparse-matrices-addition-and-sub-matrices/lists"}