{"id":19735530,"url":"https://github.com/3ein39/sparse_array_matrix","last_synced_at":"2025-07-26T07:32:54.308Z","repository":{"id":158381596,"uuid":"529654331","full_name":"3ein39/Sparse_Array_Matrix","owner":"3ein39","description":"Representing an array of very huge indices (e.g. 10^8) using doubly linked list ","archived":false,"fork":false,"pushed_at":"2022-08-30T18:16:52.000Z","size":24,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-28T04:58:21.828Z","etag":null,"topics":["data-structures","doubly-linked-list","linked-list","sparse-matrices","sparse-matrix"],"latest_commit_sha":null,"homepage":"","language":"C++","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/3ein39.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":"2022-08-27T17:36:08.000Z","updated_at":"2022-08-30T18:17:32.000Z","dependencies_parsed_at":null,"dependency_job_id":"4c6b2935-8b09-4815-93f6-2c5432ac2166","html_url":"https://github.com/3ein39/Sparse_Array_Matrix","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/3ein39/Sparse_Array_Matrix","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/3ein39%2FSparse_Array_Matrix","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/3ein39%2FSparse_Array_Matrix/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/3ein39%2FSparse_Array_Matrix/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/3ein39%2FSparse_Array_Matrix/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/3ein39","download_url":"https://codeload.github.com/3ein39/Sparse_Array_Matrix/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/3ein39%2FSparse_Array_Matrix/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267135740,"owners_count":24041099,"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","status":"online","status_checked_at":"2025-07-26T02:00:08.937Z","response_time":62,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["data-structures","doubly-linked-list","linked-list","sparse-matrices","sparse-matrix"],"created_at":"2024-11-12T00:42:14.357Z","updated_at":"2025-07-26T07:32:54.300Z","avatar_url":"https://github.com/3ein39.png","language":"C++","readme":"\n# [Sparse 1D Array](https://github.com/3ein39/Sparce_Array_Matrix/blob/main/1d_sparce.cpp) \n\n\nRepresenting an array of very huge indicies (e.g. 10^8) using doubly linked list .. \n\n- In some applications, we might want to represent an array with indices very huge (e.g. 10^8), however, most of it are just zeros (e.g. 95%).\n- Creating such huge arrays is very time \u0026 memory harmful with no return.\n* The following functions are supported :\n    - Set \u0026 Get positions.\n    - Print \u0026 Add arrays.\n---\n# [SparseMatrix (2D Array)](https://github.com/3ein39/Sparce_Array_Matrix/blob/main/2d_sparce.cpp) \nA more severe/common case is a sparse matrix where most of it are zeros which is implemented here.\n\n- Similarly, SparseMatrix acts like a 2D array.\n* Now we can think of sparse matrix as linked list of linked list\n    - 2 linked lists.\n    - First: the 1D array linked list\n    - Second: linked list, the data of each node is a 1D linked list\n    - Again .. A double ll is used.\n    \n## Acknowledgements\n\n - [Mastering critical SKILLS in Data Structures using C++](https://www.udemy.com/course/dscpp-skills/)\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F3ein39%2Fsparse_array_matrix","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F3ein39%2Fsparse_array_matrix","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F3ein39%2Fsparse_array_matrix/lists"}