/Data-Structures-with-Algorithms

Data Structures and Algorithms in cpp

Primary LanguageC++

Data-Structures-with-Algorithms

Data Structures and Algorithms in c++

Code ;; tab : 4 spaces

Each sub folder has implementation with applications

All the starter files in each end sub folder has base file to start with.

The filename ending with "base" is the main intro file to each datastructure

The filename starting in "App" are the applications to each datastructure

Data Structures

Stack

stack_functions_base.cpp

Appn1.Nqueen_problem.cpp

Queue

queue_functions_base.cpp

Linked List

singly_linked_list_base.cpp

doubly_linked_list_base.cpp

Trees

binary_tree_base.cpp

Graphs

graph_using_array_representation_base.cpp

graph_using_adjacency_list_representation_base.cpp

App1.transitive_closure_graph.cpp

App2.warshall_nonweighted.cpp

App3.warshall_weighted.cpp

App4.bfs_dfs.cpp

Algorithms

Sorting of 1-d array

bubble_sort_numbers.cpp

selection_sort_numbers.cpp

insertion_sort_numbers.cpp

heap_sort_numbers.cpp

merge_sort_numbers.cpp

quick_sort_numbers.cpp

counting_sort_numbers.cpp

radix_sort_numbers.cpp

Sorting of 2-d array

bubble_sort_numbers.cpp

selection_sort_numbers.cpp

insertion_sort_numbers.cpp

heap_sort_numbers.cpp

merge_sort_numbers.cpp

quick_sort_numbers.cpp

Folder structure

Data-Structures-with-Algorithms
│   README.md
│   index.html
|   styles.css
|   script.js

└───Data Structures
│   │
│   │   README.md
│   │
│   └───Stack
│   |   |
│   |   |   README.md
│   |   │   stack_functions_base.cpp
│   |   │   Appn1.Nqueen_problem.cpp
│   |  
│   └───Queue
│   |   |
│   |   |   README.md
│   │   |   queue_functions_base.cpp
│   │
│   └───Linked List
│   |   |
│   |   |   README.md
│   │   |   singly_linked_list_base.cpp
│   │   |   doubly_linked_list_base.cpp
│   │
│   └───Tree
│   |   |
│   |   |   README.md
│   │   |   binary_tree_base.cpp
│   │
│   └───Graph
│   |   |
│   |   |   README.md
│   │   |   graph_using_array_representation_base.cpp
│   │   |   graph_using_adjacency_list_representation_base.cpp
│   |   |   App1.transitive_closure_graph.cpp
│   |   |   App2.warshall_nonweighted.cpp
│   |   |   App3.warshall_weighted.cpp
│   |   |   App4.bfs_dfs.cpp
│   │

└───Algorithms
│   │
│   │   README.md
│   │
│   └───Sorting of 1-d array
│   |   |
│   |   |   README.md
│   |   │   bubble_sort_numbers.cpp
│   |   │   selection_sort_numbers.cpp
│   │   │   insertion_sort_numbers.cpp
│   |   │   heap_sort_numbers.cpp
│   |   │   merge_sort_numbers.cpp
│   |   │   quick_sort_numbers.cpp
│   |   │   counting_sort_numbers.cpp
│   |   │   radix_sort_numbers.cpp
│   │
│   └───Sorting of 2-d array
│   |   |
│   |   |   README.md
│   |   │   bubble_sort_numbers.cpp
│   |   │   selection_sort_numbers.cpp
│   │   │   insertion_sort_numbers.cpp
│   |   │   heap_sort_numbers.cpp
│   |   │   merge_sort_numbers.cpp
│   |   │   quick_sort_numbers.cpp
│   |