DATA STRUCTURES

Organising data in an organised way in computer to use them effectively is known as Data Structures. An organised date can be used to implement various operations effectively. Some of them are Traversing,Sorting,Searching etc.

Types of Data Structure:

Array
Stack
Queue
Linked list
Graph
Tree
and many more...

ALGORITHM

Algorithm is the way to do operations on this data structutes.

Types of Algorithms

Sorting
Searching
Traversing
and many more

Name		Name	Last commit message	Last commit date
Latest commit History 113 Commits
searching algorithms		searching algorithms
8_BFS.c		8_BFS.c
ATM_Queue_Google_KickStart.cpp		ATM_Queue_Google_KickStart.cpp
Array_Stack.cpp		Array_Stack.cpp
Binary_Search_Tree_Array.cpp		Binary_Search_Tree_Array.cpp
Binary_Search_Tree_Linked_List.cpp		Binary_Search_Tree_Linked_List.cpp
Book_Allocation_In_Min_Time.cpp		Book_Allocation_In_Min_Time.cpp
Bubble-Sort.cpp		Bubble-Sort.cpp
Dijkstra.cpp.cpp		Dijkstra.cpp.cpp
Dijkstra’s_shortest_path_algorithm.cpp		Dijkstra’s_shortest_path_algorithm.cpp
Find_BST_In_Binary_Tree.cpp		Find_BST_In_Binary_Tree.cpp
Find_Largest_BST_In_BinaryTree.cpp		Find_Largest_BST_In_BinaryTree.cpp
Find_Unique_Number		Find_Unique_Number
Flood-Fill-All-Paths-C++		Flood-Fill-All-Paths-C++
Fractional Knapsack		Fractional Knapsack
InfixtoPostfix.cpp		InfixtoPostfix.cpp
Insertionsort.cpp		Insertionsort.cpp
Johnson_Algorithm.cpp		Johnson_Algorithm.cpp
Juggling_Algo.(Array_Rotation).cpp		Juggling_Algo.(Array_Rotation).cpp
Kahns_algo.cpp		Kahns_algo.cpp
Linked_List.cpp		Linked_List.cpp
Linked_Stack.cpp		Linked_Stack.cpp
Matrix Chain Multiplication		Matrix Chain Multiplication
Minimum Spanning Tree using kruskal algo		Minimum Spanning Tree using kruskal algo
N Queen Problem.cpp		N Queen Problem.cpp
N-Queens.cpp		N-Queens.cpp
Prim's algorithm for finding MST		Prim's algorithm for finding MST
Queue.cpp		Queue.cpp
Queue_using_array.c		Queue_using_array.c
Quick_sort_algorithm.cpp		Quick_sort_algorithm.cpp
Quicksort.cpp		Quicksort.cpp
README.md		README.md
Radix Sort.cpp		Radix Sort.cpp
STL.cpp		STL.cpp
Selectionsort.cpp		Selectionsort.cpp
Shell_Sort		Shell_Sort
Stack.cpp		Stack.cpp
Stack_using_array.c		Stack_using_array.c
Strassen-Equation		Strassen-Equation
Subset-Sum-to-K		Subset-Sum-to-K
Traversals of trees.cpp		Traversals of trees.cpp
bfs.cpp		bfs.cpp
bfs_map.cpp		bfs_map.cpp
binomialheap.c		binomialheap.c
breadth_first_search.cpp		breadth_first_search.cpp
bubble-sort.cpp		bubble-sort.cpp
bucketSort.cpp		bucketSort.cpp
check_prime.cpp		check_prime.cpp
counting sort.cpp		counting sort.cpp
depth_first_search_recursive.cpp		depth_first_search_recursive.cpp
depth_first_search_using_stack.cpp		depth_first_search_using_stack.cpp
dfs.cpp		dfs.cpp
dijkstra.cpp		dijkstra.cpp
disjoint-set.cpp		disjoint-set.cpp
double linked list		double linked list
fenwick-tree.cpp		fenwick-tree.cpp
floyd.cpp		floyd.cpp
gcd.cpp		gcd.cpp
heap sort.cpp		heap sort.cpp
heapSort.cpp		heapSort.cpp
kadanes_algorithms.cpp		kadanes_algorithms.cpp
kruskalAlgorithm.cpp		kruskalAlgorithm.cpp
leap-year.cpp		leap-year.cpp
linear-search.cpp		linear-search.cpp
linkedlist_search.cpp		linkedlist_search.cpp
maximum-subarray-problem.cpp		maximum-subarray-problem.cpp
merge_sort.cpp		merge_sort.cpp
palindrome_number.cpp		palindrome_number.cpp
permutation_of_string.cpp		permutation_of_string.cpp
prefix_sum.cpp		prefix_sum.cpp
prefix_sum_array.cpp		prefix_sum_array.cpp
prims.cpp		prims.cpp
quicksort.cpp		quicksort.cpp
reverse_LinkedList.cpp		reverse_LinkedList.cpp
segment tree max query update.cpp		segment tree max query update.cpp
segment-tree.cpp		segment-tree.cpp
segment_tree.cpp		segment_tree.cpp
sieve.cpp		sieve.cpp
singly_linked_list.c		singly_linked_list.c
spf.cpp		spf.cpp
swapElements.cpp		swapElements.cpp
template.cpp		template.cpp
topologicalsort.cpp		topologicalsort.cpp
transitiveclosure.cpp		transitiveclosure.cpp

aditya10chauhan/Data-Structures

Folders and files

Latest commit

History