Data structure and algorithm

You can easily deduce how to calculate the surrounding area, the total area and the rectangular box volume based on the formula for calculating the area of ​​the rectangle and the

If you are wondering about cube formulas such as area, volume, you can refer to the formulas that will be summarized in this article.

In fact, we encounter a lot of spherical objects in our daily life, most familiar with all kinds of balls (football, volleyball, basketball ...), or our earth is in the form of a

You can easily see that we often catch a dead end in life like a bucket or lampshade ... With Quantrimang learn about the dead end, the formula for calculating the area and volume

The pyramid is formed when rotating a right triangle around its axis (a right-angled edge) one round.

TipsMake.com will work with you to learn some content related to the topic of calculating the volume of the cylinder, the area around and the whole cylinder. Please consult with

The rectangle is one of the most common figures in reality when calculating the area, such as calculating the area of ​​land, houses, objects ...

It can be affirmed that the square is one of the pictures with the most memorable area and perimeter formula in all types.

The parallelogram is a quadrilateral with 2 pairs of parallel opposing sides or 1 pair of parallel and equal sides.

The rhombus is a quadrilateral with 4 equal sides. This is a parallelogram with two equal adjacent edges or parallelograms with two perpendicular diagonal lines.

There are many different ways to calculate the area of ​​a triangle with many commonly used formulas as well as formulas when used should be proved.

In this article, TipsMake.com will reintroduce effective circular area and circumference formulas for learning and work.

The Hash Table data structure is a data structure that stores data in a federated manner. In Hash Table, data is stored in array format, in which data values ​​have their own

Sorting is to arrange data in a specific format. In computer science, sorting algorithms determine how to arrange data in a certain order. Sorted in order here is arranged in

Bubble arrangement is a simple sort algorithm. This sorting algorithm is carried out based on comparing pairs of adjacent and swap elements if they are not in order.

Sort insertion is a sorting algorithm based on in-place comparison. Here, a sub-list is always maintained in sorted form. Inserting is inserting an element into the sorted list

What happens if the data entered into the binary search tree (BST) is in ordered form (ascending or descending). It will look like the following.

A spanning tree is a subset of Grahp G that has all vertices enclosed by the minimum number of edges. Therefore, a spanning tree will not form a cycle and it cannot be interrupted

Data structure The heap is a special case of a balanced binary tree data structure, where the root node's key is compared to its children and arranged accordingly.

Selection Sort is a simple algorithm. This sorting algorithm is an algorithm based on in-place comparison, in which the list is divided into two parts, sorted (list) on the left