C # input values in the form,

C # input values in the form,

Sort it out:

1. static variable value transfer, which is very simple and suitable for simple non-instance

public calss form1:Form{    public static int A;}public class form2:Form{   form1.A=1; }

2. Delegate value transfer

Public class form1: Form {public int A {get; set;} public static Action <int> setIntADelForClass; // class delegate public Action <int> setIntADel // instance delegate public void setintA (int a) {A = a;} public void form_load (object sender, EventArgs e) {setIntADelForClass = setIntA; setIntADel = setIntA;} public class form2: Form {public void setFom1IntA {form1.setIntADelForClass (10 ); // use the class delegate to set the variable of form1 to 10 form1 fm1 = new form1 (); fm1.setIntADel (12 ); // set the variable of the new instance fm1 to 12 through instance delegation }}

3. Use the onwer attribute to transfer values between dialogs.

Public class Form1: Form {public int A {get; set;} private void button#click (object sender, EventArgs e) {A = 10; Form2 fm2 = new Form2 (); fm2.ShowDialog (this) ;}} public class Form2: Form {private void button#click (object sender, EventArgs e) {Form1 fm = (Form1) this. owner; MessageBox. show (fm. a); // read A fm of Form1. A = 11; // write A of Form1 }}

Of course, you can also use the delegate to continue passing the value

4. restructured the form constructor and pass the value during initialization. It is only suitable for initialization and is not convenient enough.

5. Delegate + Event Methods

The following code is A click on the Form1 button so that the Form1.textbox content of the Form2 button can be transferred A lot of values at A time. The step is to declare an event in Form, the method that implements the same method signature in Form B assigns a value to the event, and the code that calls back the method Form1 in Form B: // ---------------------------------------------- Form1 --------------- public partial class Form1: form {public string B // obtain textbox1 text {get {return textBox1.Text;} set {textBox1.Text = value ;}} public delegate void EventArgsaccept (object sender, acceptEventArgs e ); // Declare an event signature delegate public static event EventArgsaccept accept; // It is equivalent to instantiating an event private void button#click (object sender, EventArgs e) {acceptEventArgs AE = new acceptEventArgs (); AE. B = B; if (accept! = Null) {accept (this, AE) ;}}} public class acceptEventArgs: EventArgs {// encapsulate the EventArgs class and add the public string B {get; set ;}// --------------------- >>---------------------------------- end code of form1 ----------- form2 code to implement a method with the same signature. For example, our accept signature is the method name (object, acceptEventArgs B); // ------------------------------------------> ------------------------------------- code of form2 --- public partial CIA Ss Form2: Form {private void Form2_Load (object sender, EventArgs e) {Form1.accept + = Form1_accept; // assign values to form1 events, when form1 executes this event, it will execute this method} void Form1_accept (object sender, acceptEventArgs e) {// implement the same method signature method this. button1.Text = e. b; }}// --------------------------> --------------- the principle is as follows: can I save the position of the function pointer by passing a value because the delegate is a function pointer? So how can I mark the corresponding instance and execute other instances? Without looking at the compilation principles, express your views and do not mislead the public.

　　

6. Global Data Reading and Writing is suitable for login verification.

AppDomain. CurrentDomain. SetData ("user", "James"); AppDomain. CurrentDomain. GetData ("user ");

　　

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">