algos.md

Algorithms

Explanation of the tool and it's purpose. Be Brief and say it concisely in a sentence

Key Terms

Heap:

Tree based data structure used to manage min and max elements **********

Min Heap:

The lowest values are prioritized/stay. Value of each node is less than or equal to the val of its children **********

Max Heap:

The highest values prioritized/stay. Value of each node is more than or equal to the val of its childen

**********

---

Helpful Python commands

Counter: part of the collections library. Create a dictionary of keys = array_element and values = Number_of_repeated_apearances

collections.counter(<array>)

**********

Heapq: Library of heap commands

heapq.heappushpop(heap, item)
heapq.heappush(heap, item) heapq.heapop(heap) heapq.heapify(list)

**********

COMMAND

``
-

**********

---

ADVANCED COMMANDS

COMMAND

``
-

**********

COMMAND

``
-

**********

---

Configs

Name_of_config

What does the config do
Config example and definition of each term

**********

---

Processes

Process

1. steps
2. step
3. step

**********

---