Source: Internet
Author: User

C # Regular Expression Regex class introduction,

**1. To use a regular expression class in C #, add the following statement at the beginning of the source file:**

Using System. Text. RegularExpressions;

**Ii. Common RegEx Methods**

**1. Static Match Method**

The static Match method is used to obtain the continuous substring of the first matching mode in the source.

**The static Match method has two reloads:**

Regex. Match (string input, string pattern );

Regex. Match (string input, string pattern, RegexOptions options );

**Input and mode parameters of the first type of Overload**

**The second type of overload parameter represents the input, mode, and RegexOptions enumerated "by bit or" combination.**

The valid values of RegexOptions enumeration are:

Complied indicates compiling this mode

CultureInvariant indicates that the cultural background is not taken into account.

ECMAScript indicates that the value meets ECMAScript. This value can only be used with IgnoreCase, Multiline, and Complied.

ExplicitCapture indicates that only explicitly-named groups are saved.

IgnoreCase indicates that the input is case insensitive.

IgnorePatternWhitespace indicates removing non-escape spaces in the mode and enabling the annotation marked #

Multiline indicates the Multiline mode and changes the meanings of metacharacters ^ and $. They can match the beginning and end of a row.

None indicates no setting. This enumeration item is meaningless.

RightToLeft indicates scanning and matching from right to left. In this case, the static Match method returns the first matching from right to left.

Singleline indicates the single line mode, which changes the meaning of metacharacters. It can match line breaks.

Note: Multiline can be used with Singleline without ECMAScript. Singleline and Multiline are not mutually exclusive, but they are mutually exclusive with ECMAScript.

**2. Static Matches Method**

This method is reloaded in the same way as the static Match method. A MatchCollection is returned, indicating the set of matching modes in the input.

**3. Static IsMatch Method**

This method returns a bool. The reload format is the same as the static Matches. If the input Matches the pattern, true is returned. Otherwise, false is returned.

It can be understood as: IsMatch method, whether the set returned by the return Matches method is null.

A simple program of C language Bubble Sorting

Main ()

{

Int I, j, temp;

Int a [10];

For (I = 0; I <10; I ++)

Scanf ("% d,", & a [I]);

For (j = 0; j <= 9; j ++)

{For (I = 0; I <10-j; I ++)

If (a [I]> a [I + 1])

{Temp = a [I];

A [I] = a [I + 1];

A [I + 1] = temp ;}

}

For (I = 1; I <11; I ++)

Printf ("% 5d,", a [I]);

Printf ("\ n ");

}

--------------

Bubble Algorithm

Algorithm Analysis and Improvement of Bubble Sorting

The basic idea of exchanging sorting is to compare the keywords of the records to be sorted in pairs. If the order of the two records is the opposite, the two records are exchanged until there is no reverse order record.

The basic concepts of application exchange sorting include Bubble sorting and quick sorting.

Bubble Sorting

1. Sorting Method

Vertically arrange the sorted record array R [1. n]. Each record R is considered as a bubble with the weight of R. key. According to the principle that a Light Bubble cannot be under a heavy bubble, scan the array R from the bottom up: Any Light Bubble scanned to a violation of this principle will make it "float" up ". This is repeated until the last two bubbles are light and heavy.

(1) initial

R [1. n] is an unordered area.

(2) First scan

The weights of two adjacent bubbles are compared from the bottom of the unordered area to the top. If the light bubbles are found to be in the lower and severe bubbles, the positions of the two bubbles are exchanged. That is, compare (R [n], R [n-1]), (R [n-1], R [N-2]),…, (R [2], R [1]); for each pair of bubbles (R [j + 1], R [j]), if R [j + 1]. key <R [j]. key, then the contents of R [j + 1] and R [j] are exchanged.

When the first scan is complete, the "lightest" bubble floated to the top of the interval, that is, the record with the smallest keyword is placed on the highest position R [1.

(3) second scan

Scan R [2. n]. When scanning is completed, the "light" bubble floated to the R [2] position ......

Finally, the sequential area R [1. n] can be obtained through n-1 scanning.

Note:

During the I-trip scan, R [1 .. I-1] and R [I.. n] are the current sequential and disordered areas, respectively. The scan continues from the bottom of the unordered area to the top of the area. When scanning is completed, the shortest bubbles in the area float to the top position R. The result is that R [1. I] is changed to a new ordered area.

2. Bubble sorting process example

Bubble Sorting of files whose keyword sequence is 49 38 65 97 76 13 27 49

3. Sorting Algorithm

(1) Analysis

Because each sort adds a bubble to the ordered area, there are n-1 bubbles in the ordered area after N-1 sort, in the disordered area, the bubble weight is always greater than or equal to the bubble weight in the ordered area. Therefore, the entire Bubble sorting process requires at most n-1 sorting.

If no bubble position exchange is found in a sorting, it means that all bubbles in the unordered area to be sorted meet the principle of being light and heavy. Therefore, the Bubble sorting process can be terminated after this sorting. Therefore, in the following algorithm, a Boolean exchange is introduced, which is set to FALSE before each sort starts. If an exchange occurs during the sorting process, set it to TRUE. Check exchange at the end of sorting. If exchange has not occurred, terminate the algorithm and no longer perform the next sorting.

(2) specific algorithms

Void BubbleSort (SeqList R)

{// R (l. n) is the file to be sorted. It uses bottom-up scanning to perform Bubble Sorting on R.

Int I, j;

Boolean exchange; // exchange flag

For (I = 1; I <G id = "1">

A simple program of C language Bubble Sorting

Main ()

{

Int I, j, temp;

Int a [10];

For (I = 0; I <10; I ++)

Scanf ("% d,", & a [I]);

For (j = 0; j <= 9; j ++)

{For (I = 0; I <10-j; I ++)

If (a [I]> a [I + 1])

{Temp = a [I];

A [I] = a [I + 1];

A [I + 1] = temp ;}

}

For (I = 1; I <11; I ++)

Printf ("% 5d,", a [I]);

Printf ("\ n ");

}

--------------

Bubble Algorithm

Algorithm Analysis and Improvement of Bubble Sorting

The basic idea of exchanging sorting is to compare the keywords of the records to be sorted in pairs. If the order of the two records is the opposite, the two records are exchanged until there is no reverse order record.

The basic concepts of application exchange sorting include Bubble sorting and quick sorting.

Bubble Sorting

1. Sorting Method

Vertically arrange the sorted record array R [1. n]. Each record R is considered as a bubble with the weight of R. key. According to the principle that a Light Bubble cannot be under a heavy bubble, scan the array R from the bottom up: Any Light Bubble scanned to a violation of this principle will make it "float" up ". This is repeated until the last two bubbles are light and heavy.

(1) initial

R [1. n] is an unordered area.

(2) First scan

The weights of two adjacent bubbles are compared from the bottom of the unordered area to the top. If the light bubbles are found to be in the lower and severe bubbles, the positions of the two bubbles are exchanged. That is, compare (R [n], R [n-1]), (R [n-1], R [N-2]),…, (R [2], R [1]); for each pair of bubbles (R [j + 1], R [j]), if R [j + 1]. key <R [j]. key, then the contents of R [j + 1] and R [j] are exchanged.

When the first scan is complete, the "lightest" bubble floated to the top of the interval, that is, the record with the smallest keyword is placed on the highest position R [1.

(3) second scan

Scan R [2. n]. When scanning is completed, the "light" bubble floated to the R [2] position ......

Finally, the sequential area R [1. n] can be obtained through n-1 scanning.

Note:

During the I-trip scan, R [1 .. I-1] and R [I.. n] are the current sequential and disordered areas, respectively. The scan continues from the bottom of the unordered area to the top of the area. When scanning is completed, the shortest bubbles in the area float to the top position R. The result is that R [1. I] is changed to a new ordered area.

2. Bubble sorting process example

Bubble Sorting of files whose keyword sequence is 49 38 65 97 76 13 27 49

3. Sorting Algorithm

(1) Analysis

Because each sort adds a bubble to the ordered area, there are n-1 bubbles in the ordered area after N-1 sort, in the disordered area, the bubble weight is always greater than or equal to the bubble weight in the ordered area. Therefore, the entire Bubble sorting process requires at most n-1 sorting.

If no bubble position exchange is found in a sorting, it means that all bubbles in the unordered area to be sorted meet the principle of being light and heavy. Therefore, the Bubble sorting process can be terminated after this sorting. Therefore, in the following algorithm, a Boolean exchange is introduced, which is set to FALSE before each sort starts. If an exchange occurs during the sorting process, set it to TRUE. Check exchange at the end of sorting. If exchange has not occurred, terminate the algorithm and no longer perform the next sorting.

(2) specific algorithms

Void BubbleSort (SeqList R)

{// R (l. n) is the file to be sorted. It uses bottom-up scanning to perform Bubble Sorting on R.

Int I, j;

Boolean exchange; // exchange flag

For (I = 1; I <G id = "1">

Related Article