Unix and Linux
SQL Server
SQL
Python
Programming C
PHP
NodeJS
MongoDB
jQuery
JavaScript
HTTP
HTML
Git
Database
Data structure and algorithm
CSS and CSS3
C ++
C #
AngularJS
25 May 2019
Browse trees in data structures and algorithms
Tree browsing is a process for accessing all the nodes of a tree and can also print the values of these nodes. Because all nodes are connected via edges (or links), we always
Program - Page 50
Learn basic programming with C, C++, Python, JavaScript, PHP, CSS, HTML5 programming languages. You can also find tutorials on databases, SQL Server here.
25 May 2019
Binary Search Tree (Binary Search Tree)
A binary search tree (BST Search Tree) is a tree in which all nodes have the following characteristics.
25 May 2019
Fibonacci series in Data Structures and Algorithms
The Fibonacci sequence creates numbers by adding two numbers in front. Fibonacci series start from two numbers: F0 & F1. The initial value of F0 & F1 may be 0, 1 or 1, 1,
25 May 2019
Algorithm for sharing (divide and conquer)
Divide and Conquer (Divide and Conquer) is an important method of designing algorithms. The idea of this method is quite simple and very easy to understand.
25 May 2019
What is Data Structure?
Data structure is a way of storing, organized and systematic data organization so that data can be used effectively.
25 May 2019
Environment settings in Data structures
Because C and C ++ languages are the languages that almost every university uses to teach, in this chapter I will guide you to install C and C ++ to run the examples in the
25 May 2019
Array data structure
Array (Array) is one of the oldest and most important data structures. Arrays can store some fixed elements and these elements have the same type. Most data structures use arrays
25 May 2019
What is algorithm?
Algorithms (also known as Algorithms - English is Algorithms) is a finite set of instructions to be executed in a certain order to get the desired result. In general, the
25 May 2019
Asymptotic analysis in Data Structures and Algorithms
The asymptotic analysis of an algorithm is a concept that helps us estimate the running time of an algorithm. Using asymptotic analysis, we can draw the best conclusions about the
25 May 2019
Greedy Algorithm (Greedy Algorithm)
Greedy Algorithm is a combination optimization algorithm. Search algorithms, select local optimal solutions in each step in the hope of finding a global optimal solution.
25 May 2019
Dynamic Programming (Dynamic Programming)
Dynamic Programming algorithms are like Divide and Conquer algorithms in breaking down problems into smaller subproblems and then into smaller subproblems. But unlike dividing to
25 May 2019
Master Theorem algorithm (Master Theorem)
We use the Theorem Theorem (Master Theorem) to effectively solve the recursive formulas of the following form.
25 May 2019
Linked list data structure (Linked List)
A Linked List is a sequence of data structures that are connected through links (links). Simply put, the Linked List is a data structure consisting of a group of nodes (nodes)
25 May 2019
Data structure of double linked list
The Doubly Linked List is a variant of the Linked List, in which browsing through the buttons can be done in two ways: easy forward and backward. when compared with Single Link
25 May 2019
Data Link List structure (Circular Linked List)
The linked list (Circular Linked List) is a variant of the Linked List, in which the first element points to the last element and the last element points to the first element.
25 May 2019
Stack data structure (Stack)
A stack is an abstract data structure (Abstract Data Type - ADT for short), mostly used in almost every programming language. Name the stack because it acts as a stack in real
25 May 2019
Queue data structure (Queue)
Queue (Queue) is an abstract data structure, is something similar to queues in everyday life (queuing).
25 May 2019
Linear search algorithm (Linear Search)
Linear Search is a very basic search algorithm. In this type of search, a continuous search operation takes place through every element. Each element is checked and if any
25 May 2019
Binary Search algorithm (Binary Search)
Binany Search is a fast search algorithm with runtime complexity of Ο (log n). The algorithm of binary search works based on the principle of division and rule (Divide and
25 May 2019
Interpolation Search algorithm (Interpolation Search)
Interpolation Search (Interpolation Search) is an improved variant of Binary Search (Binary Search). In order for this search algorithm to work correctly, the data set must be