{"id":16238194,"url":"https://github.com/kanishkrawatt/c_programming","last_synced_at":"2025-04-08T08:49:48.785Z","repository":{"id":50087328,"uuid":"518558321","full_name":"Kanishkrawatt/C_Programming","owner":"Kanishkrawatt","description":" A collection of resources to learn concepts for C ","archived":false,"fork":false,"pushed_at":"2022-12-01T19:35:13.000Z","size":511,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-14T05:44:26.378Z","etag":null,"topics":["c","competitive-programming","dsa"],"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/Kanishkrawatt.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}},"created_at":"2022-07-27T17:47:15.000Z","updated_at":"2023-03-21T13:40:21.000Z","dependencies_parsed_at":"2023-01-22T13:45:46.348Z","dependency_job_id":null,"html_url":"https://github.com/Kanishkrawatt/C_Programming","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/Kanishkrawatt%2FC_Programming","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kanishkrawatt%2FC_Programming/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kanishkrawatt%2FC_Programming/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kanishkrawatt%2FC_Programming/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Kanishkrawatt","download_url":"https://codeload.github.com/Kanishkrawatt/C_Programming/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247809969,"owners_count":20999811,"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":["c","competitive-programming","dsa"],"created_at":"2024-10-10T13:39:15.696Z","updated_at":"2025-04-08T08:49:48.768Z","avatar_url":"https://github.com/Kanishkrawatt.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"## [DSA]() \nIn Computer Terms, A data structure is a Specific way to store and organize in a computer's memory so that these data can be use efficiently later. \n\n#### Classification of DS\n* Linear Vs Non-Linear Data Structure\n* Homogenous Vs Non-Homogenous Data Structure\n* Static Vs Dynamic \n* Primitive Vs Non-Primitive\n\n#### Types of DS\n* [Array](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/array) \n* [LinkedList](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/linkedList)\n* [Stack](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/stacks)\n* [Queues](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/queue)\n* [Trees](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/trees)\n* [Graphs]()\n\n### [Array](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/array)\nArray are collection of Homogenous Elements in Continious Order\n* It is Linear\n* It is Homogenous\n* It is Static\n* It is Non-Primitive \n\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; \u0026nbsp; \u0026nbsp; Elements\n\u003cbr\u003e\n\n| A | B | C | D |   \n|--:|--:|--:|--:|\n| 0 | 1 | 2 | 3 |  \n\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;Index\n\n\u003cbr\u003e\n\n```Array\n\n// Initialization of Array\nint Arr[]= {1,2,3,4,5};\n\n// Array Declaration \nint Arr[Size_Of_Array];\n\n``` \n\u003cbr\u003e\n\n### [Linked List](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/linkedList)\nIt is Collection of Nodes Where node has a Two Part First Part is Info And The second Part is Link. \u003cbr\u003e\nIn Info, The Value is Stored and,\u003cbr\u003e\nIn Link Part, Address of next Node is stored. \u003cbr\u003e\nThere is a **Special Pointer** Which stores the **address of Fist Node** called **START**\u003cbr\u003e\nand a **Special Pointer** Which stores **NULL** in Link called **END**\n\u003cbr\u003e\n  | Info | Link |  \n  |-----:|-----:|\n\u003cbr\u003e\n\n```Structure\n\n// Structure of Node\n\nstruct Node{\n    int info;           // INFO Part (can store any value)\n    struct Node * Link; // Link Part (Stores The address of Next Node)\n}\n\n```\n## [Stack](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/stacks)\n\nIt is based on LIFO, Last in First out , where insertion and deletion take place at one end Called Top.\u003cbr\u003e\nInsertion is known as **PUSH**\u003cbr\u003e\nDeletion is Known as **POP**  \n\n**STACK**\u003cbr\u003e\n\n | \u0026nbsp; |    \n |--:|\n | B |\n | C |\n | D |\n\n ## [Queue](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/queue)\n It is Based On Fifo , where insertion take place at rare end and deletion take place at front End;\n\n\n## [Trees](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/trees)\nIt is a Hierarchical representation of Data\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkanishkrawatt%2Fc_programming","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkanishkrawatt%2Fc_programming","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkanishkrawatt%2Fc_programming/lists"}