https://github.com/kanishkrawatt/c_programming
A collection of resources to learn concepts for C
https://github.com/kanishkrawatt/c_programming
c competitive-programming dsa
Last synced: about 1 year ago
JSON representation
A collection of resources to learn concepts for C
- Host: GitHub
- URL: https://github.com/kanishkrawatt/c_programming
- Owner: Kanishkrawatt
- Created: 2022-07-27T17:47:15.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2022-12-01T19:35:13.000Z (over 3 years ago)
- Last Synced: 2025-02-14T05:44:26.378Z (over 1 year ago)
- Topics: c, competitive-programming, dsa
- Language: C
- Homepage:
- Size: 499 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
## [DSA]()
In 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.
#### Classification of DS
* Linear Vs Non-Linear Data Structure
* Homogenous Vs Non-Homogenous Data Structure
* Static Vs Dynamic
* Primitive Vs Non-Primitive
#### Types of DS
* [Array](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/array)
* [LinkedList](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/linkedList)
* [Stack](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/stacks)
* [Queues](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/queue)
* [Trees](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/trees)
* [Graphs]()
### [Array](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/array)
Array are collection of Homogenous Elements in Continious Order
* It is Linear
* It is Homogenous
* It is Static
* It is Non-Primitive
Elements
| A | B | C | D |
|--:|--:|--:|--:|
| 0 | 1 | 2 | 3 |
Index
```Array
// Initialization of Array
int Arr[]= {1,2,3,4,5};
// Array Declaration
int Arr[Size_Of_Array];
```
### [Linked List](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/linkedList)
It is Collection of Nodes Where node has a Two Part First Part is Info And The second Part is Link.
In Info, The Value is Stored and,
In Link Part, Address of next Node is stored.
There is a **Special Pointer** Which stores the **address of Fist Node** called **START**
and a **Special Pointer** Which stores **NULL** in Link called **END**
| Info | Link |
|-----:|-----:|
```Structure
// Structure of Node
struct Node{
int info; // INFO Part (can store any value)
struct Node * Link; // Link Part (Stores The address of Next Node)
}
```
## [Stack](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/stacks)
It is based on LIFO, Last in First out , where insertion and deletion take place at one end Called Top.
Insertion is known as **PUSH**
Deletion is Known as **POP**
**STACK**
| |
|--:|
| B |
| C |
| D |
## [Queue](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/queue)
It is Based On Fifo , where insertion take place at rare end and deletion take place at front End;
## [Trees](https://github.com/Kanishkrawatt/C_Programming/tree/main/DSA/trees)
It is a Hierarchical representation of Data