Program - Page 49

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

Projection in MongoDB

In MongoDB, projection's meaning is to select only the necessary data instead of selecting the entire data of a Document. If a Document has 5 fields and you only need 3 fields,

25 May 2019

Limit records in MongoDB

To limit the records in MongoDB, you need to use the limit () method. The limit () method takes a parameter in a numeric format, which is the Document number you want to display.

25 May 2019

Sort records in MongoDB

To sort documents in MongoDB, you need to use the sort () method. The sort () method takes a Document containing a list of fields with their sort order. To determine the sort

25 May 2019

Index (Mong) in MongoDB

Index (Index) supports the resolution of queries more efficiently. Without an index, MongoDB must scan through all a Collection's Document to select the Documents that connect to

25 May 2019

Hash Table data structure

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

25 May 2019

Algorithms arranged in data structures & algorithms

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

25 May 2019

Bubble Sort (Bubble Sort)

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.

25 May 2019

Insert algorithm (Insertion Sort)

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

25 May 2019

AVL tree in data structure and algorithm

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.

25 May 2019

Spanning Tree in data structure and algorithm

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

25 May 2019

Heap data structure

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.

25 May 2019

Selection sort algorithm (Selection Sort)

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

25 May 2019

Basics of recursion (Recursion)

Some programming languages allow a module or function to be called to itself. This technique is called Recursion.

25 May 2019

Problem of Hanoi Tower (Tower of Hanoi)

Problem of Hanoi Tower (Tower of Hanoi) is a math game consisting of 3 columns and with more disk numbers 1.

25 May 2019

Alignment algorithm (Merge Sort)

Mixing (Merge Sort) is an arrangement algorithm based on the Divide and Conquer algorithm. With the worst case time complexity of Ο (n log n), this is one of the algorithms that

25 May 2019

Shell Sort in data structure and algorithm

Shell Sort is a highly efficient sorting algorithm based on insertion sorting algorithm (Insertion Sort). This algorithm avoids the case of swapping positions of two distant

25 May 2019

Quick Sort (Quick Sort)

Quick Sort is a highly efficient algorithm and is based on dividing the array into smaller pieces.

25 May 2019

Graph data structure (Graph)

A graph (graph) is a form of visual representation of a set of objects in which pairs of objects are connected by links. Interconnected objects are represented by points called

25 May 2019

Deep search algorithm

Deep search algorithms (Depth First Search - DFS for short), also called depth-first search algorithms, are algorithms that browse or search on a tree or graph and use the stack (

25 May 2019

Search algorithm by width

The breadth search algorithm (Breadth First Search - BFS for short) walks through a wide graph and uses a queue to memorize adjacent vertices to start the search when no peak is

1 ... 50 51 52 53 54 55 56 57 58 ... 88