Data-Structure

Data structure is a way of organizing the data in computer so we can use efficiencly.

we can classified data structure in two parts:-

Primitive
1. Non-Primitive
Primitive: This type of data structure directly operate on machine instruction. This are predefined. A) Integer B) Float C) Character D) Pointer
Non-primitive: This type of DS derived from primitive DS. They are not directly operate upon machine. We can classfied Non-primitive DS into two categories:
Linear 1) Array 2) Stack 3) Queue 4) Linked List
Non-linear 1) Tree 2) Graph

Name		Name	Last commit message	Last commit date
Latest commit History 34 Commits
2D_array_1.c		2D_array_1.c
Arrays_operation.c		Arrays_operation.c
Binary_search_tree.c		Binary_search_tree.c
C-Queue.c		C-Queue.c
Calculated_power_using_recursion.c		Calculated_power_using_recursion.c
Circular-Linked-List.c		Circular-Linked-List.c
Circular_Doubly_Linked_list.c		Circular_Doubly_Linked_list.c
Doubly_Link_List.c		Doubly_Link_List.c
InsertionSort.c		InsertionSort.c
Linked_List.c		Linked_List.c
Nth_no_in_fibonacci_series.c		Nth_no_in_fibonacci_series.c
Queue.c		Queue.c
Quick_Sort.c		Quick_Sort.c
README.md		README.md
bubble_sort.c		bubble_sort.c
check_paranthesis.cpp		check_paranthesis.cpp
check_parentheses.cpp		check_parentheses.cpp
check_prime_no_using_recursion.c		check_prime_no_using_recursion.c
factorial_using_recursion.c		factorial_using_recursion.c
fibonacci_series_using_recursion.c		fibonacci_series_using_recursion.c
greatest_common_factor_using_recursion.c		greatest_common_factor_using_recursion.c
merge_sort.c		merge_sort.c
multiplication_table_using_recursion.c		multiplication_table_using_recursion.c
prime_series_using_recursion.c		prime_series_using_recursion.c
reverse_num_using_recursion.c		reverse_num_using_recursion.c
reverse_string_stack.c		reverse_string_stack.c
selection_sort.c		selection_sort.c
stack.c		stack.c

Provide feedback