{"id":20356561,"url":"https://github.com/madhurimarawat/data-structure-using-c","last_synced_at":"2025-08-26T02:14:06.166Z","repository":{"id":187730648,"uuid":"676647167","full_name":"madhurimarawat/Data-structure-using-C","owner":"madhurimarawat","description":"This repository contains programs in the C programming language related to Data Structures.","archived":false,"fork":false,"pushed_at":"2024-07-16T11:11:47.000Z","size":167,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-04T17:43:39.319Z","etag":null,"topics":["add-digit","basic-programming","c","data-structures","deletion-in-array","dynamic-memory-allocation","insertion","library-functions","linked-list","linked-list-in-c","menu-driven-program","priority-queue","queue","searching-algorithms","sorting-algorithms","sorting-algorithms-implemented","stack","static","string-functions","user-defined-functions"],"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/madhurimarawat.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-08-09T17:16:43.000Z","updated_at":"2024-08-21T17:08:16.000Z","dependencies_parsed_at":null,"dependency_job_id":"d8dd13c3-4049-47fe-8da0-14e2aa571976","html_url":"https://github.com/madhurimarawat/Data-structure-using-C","commit_stats":null,"previous_names":["madhurimarawat/data-structure-using-c"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/madhurimarawat/Data-structure-using-C","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/madhurimarawat%2FData-structure-using-C","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/madhurimarawat%2FData-structure-using-C/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/madhurimarawat%2FData-structure-using-C/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/madhurimarawat%2FData-structure-using-C/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/madhurimarawat","download_url":"https://codeload.github.com/madhurimarawat/Data-structure-using-C/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/madhurimarawat%2FData-structure-using-C/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272160241,"owners_count":24883779,"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-08-26T02:00:07.904Z","response_time":60,"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":["add-digit","basic-programming","c","data-structures","deletion-in-array","dynamic-memory-allocation","insertion","library-functions","linked-list","linked-list-in-c","menu-driven-program","priority-queue","queue","searching-algorithms","sorting-algorithms","sorting-algorithms-implemented","stack","static","string-functions","user-defined-functions"],"created_at":"2024-11-14T23:17:02.682Z","updated_at":"2025-08-26T02:14:06.144Z","avatar_url":"https://github.com/madhurimarawat.png","language":"C","readme":"# Data-structure-using-C \nThis repository contains programs in the C programming language related to Data Structures.\n\u003cbr\u003e\u003cbr\u003e\n\u003cimg src=\"https://github.com/madhurimarawat/Data-structure-using-C/assets/105432776/27d4b87e-5b9a-46de-9a95-a8bf45b021fc\" height=400\u003e\n\n---\n\n# About C Programming\n\n\u003cimg src=\"https://github.com/madhurimarawat/Data-structure-using-C/assets/105432776/c8b5fda5-7d9d-4c27-97c0-4fdf3f384a1e\" height=400 width=650 \u003e \u003cbr\u003e\u003cbr\u003e\n--\u003e C is a general-purpose programming language.\u003cbr\u003e\u003cbr\u003e\n--\u003e It is Procedural Programming language.\u003cbr\u003e\u003cbr\u003e\n--\u003e It has been used to develop operating systems, databases and applications.\u003cbr\u003e\u003cbr\u003e\n--\u003e It is Middle Level Programming language and gives more control to Programmer.\n\n---\n# Mode of Execution used \u003cimg src=\"https://logodix.com/logo/1709678.png\" height=30px width=30px\u003e\n\u003ch2\u003eGCC Compiler\u003c/h2\u003e\n--\u003e GCC stands for GNU C/C++ Compiler.\u003cbr\u003e\u003cbr\u003e\n--\u003e To begin with GCC, visit the official website \u0026nbsp;\u003ca href=\"https://gcc.gnu.org/\"\u003e\u003cimg src=\"https://logodix.com/logo/1709678.png\" height=30px width=30px\u003e\u003c/a\u003e\u003cbr\u003e\u003cbr\u003e\n--\u003e Download GCC according to the platform being used like Linux, MacOs or Windows.\u003cbr\u003e\u003cbr\u003e\n--\u003e Follow the setup wizard.\u003cbr\u003e\u003cbr\u003e\n--\u003e Write c code in any text editor or IDE and save it with .c extention.\u003cbr\u003e\u003cbr\u003e\n--\u003e Then just open the console and run this command -\u003cbr\u003e\u003cbr\u003e\n\n```\ngcc filename.c -o Output\n```\n--\u003e Filename is the name of the C script file and Output is the name of the output file.\u003cbr\u003e\u003cbr\u003e\n--\u003e After this command is executed, if the code is successfully compiled output file will be saved in the same location as the code file.\u003cbr\u003e\u003cbr\u003e\n--\u003e Once this Output file is executed in command prompt, the output will be displayed.\n\n---\n\n# C Programming Features\n\u003cimg src=\"https://github.com/madhurimarawat/Data-structure-using-C/assets/105432776/3d99adf0-a064-4ded-a54e-0b930869c9d4\" height=400 width=650\u003e\n\n---\n\n# Data Structures\n--\u003e A data structure is a storage that is used to store and organize data. \u003cbr\u003e\u003cbr\u003e\n--\u003e It is a way of arranging data on a computer so that it can be accessed and updated efficiently.\u003cbr\u003e\n\n\u003ch1\u003eData Structures in C\u003c/h1\u003e\n\n\u003cimg src=\"https://media.geeksforgeeks.org/wp-content/uploads/20220520182504/ClassificationofDataStructure-660x347.jpg\" height=400 width=650\u003e\n\u003ch2\u003e1. Linear data structure:\u003c/h2\u003e\n\u003cp\u003eData structure in which data elements are arranged sequentially or linearly, where each element is attached to its previous and next adjacent elements, is called a linear data structure. \u003c/p\u003e\n\u003ch2\u003ei) Static data structure\u003c/h2\u003e \n--\u003e Static data structure has a fixed memory size. \u003cbr\u003e\u003cbr\u003e\n--\u003e It is easier to access the elements in a static data structure. \u003cbr\u003e\u003cbr\u003e\n\u003ch2\u003e a) Array\u003c/h2\u003e\n--\u003eAn Array is a sequential collection of elements, of the same data type.\u003cbr\u003e\u003cbr\u003e\n--\u003e They are stored sequentially in memory. An Array is a data structure that holds a similar type of elements.\u003cbr\u003e\u003cbr\u003e\n\u003ch2\u003eii) Dynamic data structure:\u003c/h2\u003e\n--\u003e Dynamic data structure: In dynamic data structure, the size is not fixed. \u003cbr\u003e\u003cbr\u003e\n--\u003e It can be randomly updated during the runtime which may be considered efficient concerning the memory (space) complexity of the code.\u003cbr\u003e\n\u003ch2\u003e a) Queue\u003c/h2\u003e\n--\u003e A Queue is a linear data structure that stores a collection of elements.\u003cbr\u003e\u003cbr\u003e\n--\u003e The queue operates on first in first out (FIFO) algorithm.\u003cbr\u003e\n\u003ch2\u003e b) Stack\u003c/h2\u003e\n--\u003e A stack is a linear data structure.\u003cbr\u003e\u003cbr\u003e\n--\u003e It follows the last in first out approach.\u003cbr\u003e\u003cbr\u003e\n--\u003e A new item is added at the top of a stack.\u003cbr\u003e\u003cbr\u003e\n--\u003e Both insert and deletion operation is performed from one end of the stack.\u003cbr\u003e\n\u003ch2\u003e c) Linked List\u003c/h2\u003e\n--\u003e A Linked List is a data structure.\u003cbr\u003e\u003cbr\u003e\n--\u003e The Linked List is like an array but, the Linked List is not stored sequentially in the memory.\u003cbr\u003e\u003cbr\u003e\n--\u003e Every linked list has 2 parts, the data section and the address section that holds the address of the next element in the list, which is called a node.\u003cbr\u003e\u003cbr\u003e\n\u003ch2\u003e2. Non-linear data structure:\u003c/h2\u003e\n\u003cp\u003eNon-linear data structure: Data structures where data elements are not placed sequentially or linearly are called non-linear data structures. In a non-linear data structure, we can’t traverse all the elements in a single run only. \u003c/p\u003e\n\u003ch2\u003e a) Tree\u003c/h2\u003e\n--\u003e A tree is a data structure that has one root node and many sub-nodes.\u003cbr\u003e\u003cbr\u003e\n--\u003e  It is another one of the data structures which are designed on top of a linked list.\u003cbr\u003e\n\u003ch2\u003e b) Graph\u003c/h2\u003e\n--\u003e A Graph is a non-linear data structure consisting of vertices and edges. \u003cbr\u003e\u003cbr\u003e\n--\u003e The vertices are sometimes also referred to as nodes and the edges are lines or arcs that connect any two nodes in the graph.\u003cbr\u003e\u003cbr\u003e\n--\u003e More formally a Graph is composed of a set of vertices( V ) and a set of edges( E ).\u003cbr\u003e \u003cbr\u003e\n--\u003e The graph is denoted by G(E, V).\n\n---\n\n## Thanks for Visiting 😄\n\nDrop a 🌟 if you find this repository useful.\u003cbr\u003e\u003cbr\u003e\nIf you have any doubts or suggestions, feel free to reach me.\u003cbr\u003e\u003cbr\u003e\n📫 How to reach me:  \u0026nbsp; [![Linkedin Badge](https://img.shields.io/badge/-madhurima-blue?style=flat\u0026logo=Linkedin\u0026logoColor=white)](https://www.linkedin.com/in/madhurima-rawat/) \u0026nbsp; \u0026nbsp;\n\u003ca href =\"mailto:rawatmadhurima@gmail.com\"\u003e\u003cimg src=\"https://github.com/madhurimarawat/Machine-Learning-Using-Python/assets/105432776/b6a0873a-e961-42c0-8fbf-ab65828c961a\" height=35 width=30 title=\"Mail Illustration\" alt=\"Mail Illustration📫\" \u003e \u003c/a\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmadhurimarawat%2Fdata-structure-using-c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmadhurimarawat%2Fdata-structure-using-c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmadhurimarawat%2Fdata-structure-using-c/lists"}