Added missing links for
- Min and Max (Iterative)
- Min and Max (D&C)
- Sorted Linked List
- Dynamic Stack
- Queue using Stacks
- Two-Sum Problem
- Isogram
- Rotten Oranges
- Find Distinct Subsets

Improved documentation by providing reliable external resources for better understanding of these algorithms.

…ically

for improved structure and ease of navigation.
Enhanced clarity by reordering entries.

Refactored README.md: Organized algorithms table alphabetically

Refactor: Organized Data Structures and Extra sections alphabetically in the README for improved clarity and ease of navigation.

Corrected file path for 'CalculatePi.cpp' in the README (Line 3735) and removed extra tab causing whitespace issue on line 2099.

…tra-tables

Update README.md : Organized Data Structures and Extra sections

Added the following new algorithms with relevant links to the Readme:

A* Algorithm
Bellman-Ford Algorithm
Ford-Fulkerson Algorithm
Gale-Shapley Algorithm
Hungarian Algorithm
Kruskal's Algorithm
Prim's Algorithm
Topological Sort
AVL Tree
Red-Black Tree

Added new algorithms  and DS with relevant links to the Readme:

Replaced C and Python logos with GitHub logo for the following algorithms with missing implementations:
A* Algorithm
Bellman-Ford Algorithm
Ford-Fulkerson Algorithm
Gale-Shapley Algorithm
Hungarian Algorithm
Kruskal's Algorithm
Prim's Algorithm
Topological Sort
AVL Tree
Red-Black Tree

Fix: Updated logos for missing algorithm implementations in Readme

…Ford

Red-Black Tree and Bellman-Ford algorithms python placeholder logos changed to the correct GitHub logo. All logos are now consistent across the new additions.

Fix: Updated Python logo placeholders for RedBlackTree & BellmanFord