In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O notation, which suppresses multiplicative constants and lower order terms. When expressed this way, the time complexity is said to be described asymptotically, i.e. , as the input size goes to infinity.
more from Wikipedia
Data structure
In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
more from Wikipedia
Tree (data structure)
In computer science, a tree is a widely used data structure that simulates a hierarchical tree structure with a set of linked nodes. Mathematically, it is an ordered directed tree, more specifically an arborescence: an acyclic connected graph where each node has zero or more children nodes and at most one parent node. Furthermore, the children of each node have a specific order.
more from Wikipedia
Link/cut tree
A link/cut tree is a type of data structure that can merge (link) and split (cut) data sets in O amortized time, and can find which tree an element belongs to in O(log) amortized time. In the original publication, Sleator and Tarjan referred to link/cut trees as “dynamic trees”.
more from Wikipedia
Graph (mathematics)
In mathematics, a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices, and the links that connect some pairs of vertices are called edges. Typically, a graph is depicted in diagrammatic form as a set of dots for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics.
more from Wikipedia
Implementation
Implementation is the realization of an application, or execution of a plan, idea, model, design, specification, standard, algorithm, or policy.
more from Wikipedia
Computer performance
Computer performance is characterized by the amount of useful work accomplished by a computer system compared to the time and resources used.
more from Wikipedia
Diameter
In geometry, a diameter of a circle is any straight line segment that passes through the center of the circle and whose endpoints are on the circle. The diameters are the longest chords of the circle. The word "diameter" derives from Greek διάμετρος (diametros), "diagonal of a circle", from δια- (dia-), "across, through" + μέτρον (metron), "a measure"). In more modern usage, the length of a diameter is also called the diameter.
more from Wikipedia