Others

1 Introduction In the previous article, we have seen a simple practical application of Ann, in this article, I will briefly explain the most basic knowledge of Ann and the principle of the program in the previous article. 2 The most basic

Depending on how you use the platform, you can open a MP3 file in a variety of ways, minimad.c a way to open the sample file under Unix, and it's not hard to rewrite it as Windows: CFile file;

BTree.cpp:Defines the entry point for the console application./*Author: ChengTime: July 2, 2001 (9:00:00-14:00:00)Content: The completion of the two-fork tree creation, forward traversal, in-sequence traversal, sequential traversalTime: July 2, 2001

Merging sort algorithm idea: The order sequence is divided into two parts of the same size, the two parts are sorted in order and then merged in sequence. Merging algorithm in merge sortvoid Merge (int array[], int start, int mid, int end){int temp1

Fast Sorting algorithm idea: Select a pivot element, treats the sort sequence to divide, after the division the sequence one part is smaller than the pivot element, one part is bigger than the pivot element, then carries on these two good dividing

[1] Printed single linked list, void Printlist (List list); Use a pointer to traverse all linked table nodes. [2] Two ascending lists, printing the corresponding elements in the tarlist, which are specified by seqlist, void printlots (list tarlist,

Insert of array: #include #define size 10 int main() { int a[size]={10,12,14,16,18,20,13,200,134,59}; /* 初始化数组 */ int b[size+1]={0},i,j,x,v; /* b数组为插入后的数组，新插入了一个元素，所以要在原数组的基础上加1 */ printf("please input insert addr:"); scanf("%d",&x); /* 插入值的位置 */

Table A table (list) is a common data structure. Mathematically, a table is an ordered set of elements. In the C language memory, tables are stored as dispersed nodes (node). Each node contains an element and a pointer to the next (or previous)

Question: At the end of the 19 century, an intellectual toy was sold in stores in Europe, with three poles on a single copper plate, and a column on the left pole, from top to bottom, with a 64-disc tower in order from small to large. The aim is to

Basic concepts: Pattern matching is a very important operation of the string, assuming that the matched body string is text and the pattern string is patterns, then the task of pattern matching is to find all patterns in text and give a position in

Sequencing is an important operation in computer programming, and its function is to rearrange any sequence of data elements (or records) into an ordered sequence of keywords. What we've known before is probably bubble sort, select sort, but in

For a problem, if we can enumerate all the solutions, then we know the solution space. So how do we find the best solution in the solution space? There is a very good way to construct the whole solution from the bottom up, and every step is to seek

If we want to build a traffic advisory system on the computer, we can use the graph structure to express the actual traffic network. It realizes the most basic function, and find out the shortest path between any two points, There are many kinds of

#include #include #define MAXSIZE typedef struct BITNO de{char data; struct Bitnode *lchild,*rchild; }bitnode,*bitree; int i = 0; Bitree Create (Bitree T,char s[]) {char ch; ch = s[i++];

Sunday algorithm for string search public class SUNDAY {public SUNDAY () {///TODO: Add constructor logic//} public int Qfind here 　　　　　　CHR (String str, string sfind) {int str_length = 0; 　　 　　　　　　int fin_length = 0; 　　　　　　int find_count = 0; 　　　

We've all encountered the problem of calculating a string formula, which is very troublesome to solve. One way I thought about it a year ago was to connect the database and execute "Select [formula] as result" to get the results. These days because

After the last talk about the tree's traversal, this time again talk about the tree summary. A summary here is the collection of data from a node in the tree into its parent node as specified. For example, you can add a value from a tree node to its

This paper mainly introduces two basic routing algorithms, namely distance vector method (Distance vector Routing) and link state algorithm (link-state Routing). routing protocols and routing algorithms are only for dynamic routing. With the

Summary This paper introduces the programming representation of Matrix, elementary transformation of matrix, the step matrix and the determinant of square. Matrix Introduction The matrix is an MXN plane table, with a two-D array can be expressed,

When a normally running large transaction (for example: The update, delete operation) is terminated, and after restarting the server, the database running the transaction is in a restored state, usually for a long time, and the user is advised to