Best algo for competitive programming updated list [

Graphs are widely-used mathematical structures visualized by two basic components: nodes and edges. Graph algorithms are used to solve the problems of representing graphs as networks like airline flights, how the Internet is connected, or social network connectivity on Facebook. 2. Dynamic programming <img alt="" src="https://miro.medium.com/v2/resize:fit:630/0*ZITcwc333vp-7x9n.png" style="height:584px; width:700px" /> Dynamic programming is used where we have problems, which can be divided into similar sub-problems, so that their results can be re-used. Mostly, these algorithms are used for optimization. Before solving the in-hand sub-problem, dynamic algorithm will try to examine the results of the previously solved sub-problems. 3. Searching and Sorting Algorithms <img alt="Comparison of Sorting Algorithms" src="https://miro.medium.com/v2/1*8Wh8KHhTWlhKOd8fvNCl1A.jpeg" style="width:700px" /> Searching algorithms are used to look for and retrieve the elements used in any data structure from that data structure itself. Sorting algorithms help arrange a list of data or an array of data into a particular order. <a href="https://medium.com/@mukhopadhyaypushan42/best-algo-for-competitive-programming-updated-list-2023-afe9a705ae83">Click Here</a>