Best Data Structures resources for learning competitive programming
Разница между en8 и en9, 270 символ(ов) изменены
Basics of algorithm↵
===================↵
1. [What is an Algorithm explanation with an example](https://programmingoneonone.com/what-is-algorithm-in-programming.html)↵
1. [Algorithm Design and Analysis](https://datastructure
sandalgorithm.com.us/algorithm-design-and-analysis.html)↵
1. [Classification of algorithms](https://datastructure
sandalgorithm.com.us/classification-of-algorithms.html)↵
1. [Evaluating and Expressing an algorithm](https://datastructure
sandalgorithm.com.us/evaluating-and-expressing-algorithm.html)↵
1. [What is Data Structures and algorithms](https://programmingoneonone.com/what-is-data-structures-and-algorithms.html)↵
1. [How to calculate running time of an algorithm](https://programmingoneonone.com/how-to-calculate-running-time-of-an-algorithm.html)↵
1. [Worst, Everage and Best-case analysis of algorithm](https://programmingoneonone.com/worst-average-and-best-case-analysis-of-algorithm.html)↵
1. [Big o notation](https://programmingoneonone.com/big-o-notation.html)↵
1. [Big o notation examples](https://programmingoneonone.com/big-o-notation-examples.html)↵
1. [Complexity of algorithm](https://datastructure
sandalgorithm.com.us/complexity-of-algorithm.html)↵
↵
Array in Data Structure↵
===========↵
 ↵
1. [Array in Data Structure](https://datastructure
sandalgorithm.com.us/array-in-data-structure.html)↵
1. [Matrix in programming](https://datastructure
sandalgorithm.com.us/matrix-in-programming.html)↵
↵
Sorting Techniques↵
===========↵
 ↵
1. [Sorting techniques in data structures](https://datastructure
sandalgorithm.com.us/sorting-techniques-in-data-structure.html)↵
1. [Selection sorting in C programming](https://datastructure
sandalgorithm.com.us/selection-sorting-in-c.html)↵
1. [Bubble sorting in C programming](https://datastructure
sandalgorithm.com.us/bubble-sorting-in-c-programming.html)↵
1. [Insertion sorting in C programming](https://datastructure
sandalgorithm.com.us/insertion-sorting-in-c.html)↵
1. [Shell sorting in C programming](https://datastructure
sandalgorithm.com.us/shell-sorting-in-c.html)↵
1. [Merge sorting in C programming](https://datastructure
sandalgorithm.com.us/merge-sorting-in-c.html)↵
1. [Radix sorting in C programming](https://datastructure
sandalgorithm.com.us/radix-sorting-in-c-programming.html)↵
1. [Quick sorting in C programming](https://datastructure
sandalgorithm.com.us/quick-sorting-in-c.html)↵
1. [Heap sorting in C programming](https://datastructure
sandalgorithm.com.us/heap-sorting-in-c-programming.html)↵
↵
Linked list and its types↵
===========↵
 ↵
1. [Linked list in data structures](https://programmingoneonone.com/linked-list-in-data-structure.html)↵
1. [Traversing in linked list](https://programmingoneonone.com/traversing-in-linked-list.html)↵
1. [Operations on the linked list](https://programmingoneonone.com/operations-on-linked-list.html)↵
1. [Insertion in linked list](https://programmingoneonone.com/insertion-in-linked-list.html)↵
1. [Deletion in a linked list](https://programmingoneonone.com/deletion-in-linked-list.html)↵
1. [Reversing a linked list](https://programmingoneonone.com/reversing-the-linked-list.html)↵
1. [Sorting a linked list](https://programmingoneonone.com/sorting-a-linked-list.html)↵
1. [Find and remove loop in linked list](https://programmingoneonone.com/find-and-remove-loop-in-linked-list.html)↵
↵
Doubly linked list↵
------------------↵
1. [Doubly linked list](https://programmingoneonone.com/doubly-linked-list.html)↵
1. [Insertion in the doubly linked list](https://programmingoneonone.com/insertion-in-doubly-linked-list.html)↵
1. [Deletion in the doubly linked list](https://programmingoneonone.com/deletion-in-doubly-linked-list.html)↵
1. [Reversing a doubly-linked list](https://programmingoneonone.com/reversing-a-doubly-linked-list.html)↵
↵
Circular linked list↵
--------------------↵
1. [Circular linked list in Data structure](https://programmingoneonone.com/circular-linked-list-in-data-structure.html)↵
1. [Insertion in circular linked list](https://programmingoneonone.com/insertion-in-circular-linked-list.html)↵
1. [Deletion in circular linked list](https://programmingoneonone.com/deletion-in-circular-linked-list.html)↵
↵
### Other types of linked list↵
1. [Merge two linked list](https://programmingoneonone.com/merge-two-linked-list-in-data-structure.html)↵
1. [Header linked list](https://programmingoneonone.com/header-linked-list-in-data-structure.html)↵
1. [Sorted linked list](https://programmingoneonone.com/sorted-linked-list.html)↵
↵
↵
Stack↵
=====↵
1. [Stack in data structure](https://programmingoneonone.com/stack-in-data-structure.html)↵
↵
Queue and it's types↵
--------------------↵
1. [Queue in data structures](https://programmingoneonone.com/queue-in-data-structure.html)↵
1. [Circular queue](https://programmingoneonone.com/circular-queue-in-data-structure.html)↵
1. [Dequeue in the data structure](https://programmingoneonone.com/dequeue-in-data-structure.html)↵
1. [Priority queue](https://programmingoneonone.com/priority-queue.html)↵
↵
1. [Polish notation](https://programmingoneonone.com/polish-notation.html)↵
↵
Tree↵
----↵
1. [Tree in the data structure](https://programmingoneonone.com/tree-in-data-structure.html)↵
↵
↵
Binary tree↵
-----------↵
1. [Binary tree](https://programmingoneonone.com/binary-tree.html)↵
1. [Array representation of binary tree](https://programmingoneonone.com/array-representation-of-binary-tree.html)↵
1. [Linked representation of binary tree](https://programmingoneonone.com/linked-representation-of-binary-tree.html)↵
1. [Traversing in binary tree](https://programmingoneonone.com/traversing-in-binary-tree.html)↵
1. [Inorder traversal in binary tree](https://programmingoneonone.com/inorder-traversal-in-binary-tree.html)↵
1. [Preorder traversal in binary tree](https://programmingoneonone.com/preorder-traversal-of-binary-tree.html)↵
1. [Postorder traversal in binary tree](https://programmingoneonone.com/postorder-traversal-in-binary-tree.html)↵
1. [Level order traversal in binary tree](https://programmingoneonone.com/level-order-traversal-of-binary-tree.html)↵
↵
Binary search tree↵
------------------↵
1. [Binary search tree](https://programmingoneonone.com/binary-search-tree.html)↵
1. [Insertion in binary search tree](https://programmingoneonone.com/insertion-in-binary-search-tree.html)↵
1. [Deletion in binary search tree](https://programmingoneonone.com/deletion-in-binary-search-tree.html)↵
↵
Heap↵
----↵
[Heap in data structure](https://programmingoneonone.com/heap-in-data-structures.html)↵
↵
Note: the links will be update and new links will be added time to time.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en9 Английский yashdeora 2025-05-17 20:56:55 270
en8 Английский yashdeora 2023-04-23 13:30:28 11338
en7 Английский yashdeora 2021-04-09 06:37:06 0 more links added
en6 Английский yashdeora 2021-04-09 06:36:06 263 Tiny change: '\n\nHeap\n[Heap in' -> '\n\nHeap\n----\n[Heap in'
en5 Английский yashdeora 2020-06-06 05:58:06 102
en4 Английский yashdeora 2020-06-05 06:30:26 72
en3 Английский yashdeora 2020-06-04 20:25:23 108
en2 Английский yashdeora 2020-06-04 20:23:28 12
en1 Английский yashdeora 2020-06-04 20:17:34 4686 Initial revision (published)