Programmer Think

Algorithm overview Ten common sorting algorithms can be divided into two categories: Comparison sort: the relative order between elements is determined by comparison. Because its time complexity cannot exceed O(nlogn), it is also called nonlinear time comparison sort. Non comparison sort: the relative order between elements is no ...

1, Foreword Mrs. HashMap is too often used to make too many introductions. Enter the text and directly flush the source code. This article is mainly based on 1.8 HashMap to tell part of the source code, the main focus is put() method and resize() method 2, Construction method of HashMap /** * Set the initialization capacity and call the ...

self-introduction xdm well, I'm a jump table, an ordered data structure. There is an array in each of my nodes. I maintain multiple pointers that can point to other nodes, so I can quickly access these nodes. That's why I'm a jump table. My average time complexity is O(logN). At worst, it is O(N). In most cases, I can compare with the efficie ...

Introduction: This article comes from the summary and record of the dark horse course, Video link . Learn data structures and algorithms. Don't memorize the results, but analyze the problem, analyze the process and implement it. The implementation method is not unique, and the idea is the positive solution. Simple sorting Bubble sorting ...

First acquaintance with STL The birth of STL For a long time, the software industry has been hoping to build something that can be reused; The object-oriented and generic programming idea of C + + aims to improve the reusability; In most cases, data structures and algorithms fail to have a set of standards, resulting in being forced to ...

Finite State MachineFinite state machine (English: finite state machine, abbreviation: FSM), also known as finite state automaton (English: finite state automaton, abbreviation: FSA), abbreviated as state machine, is a mathematical calculation model that represents finite states, transitions and actions between these states- WikipediaElements o ...

Idea: If you only look at the query operation, it is a very common chairman tree, but a modification operation is added to this topic, which is not available in the previous chairman tree topic. That is, the so-called interval modification, which is to deal with the modification operation first and query instead of sandwiching modification in ...

Catalogue preface Quick sort Basic use Parameter interpretation Simulation Implementation preface First of all, I wish you a happy New Year 🎉 🎉 🎉! hello ✨， Hello, everyone. This is the original 💖 💛💙， With more and more articles, there may be many partners who can't find the articles they want to read, so I came out. ...

preface C + + introduces the idea of object-oriented. Compared with C language, a class can better manage and operate some data structures. In C language, we use character array and string The library function in H is used to maintain a string. The data is separated from the method. Because the underlying space is maintained by itself, it may ...

7-1 depth first search I (100 points) Undirected graph G has n vertices and m edges. Find the depth first search tree (forest) of graph G and the discovery time and completion time of each vertex. Each connected component is searched from the node with the smallest number, and the selection order of adjacent vertices follows the input order of ...