SortingAll sorting algorithms rely on two fundamental operations, comparison and swapping. Comparison is straight-forward. Swapping is a little more complex. Consider the following problem. We want to swap the value of a and b . Most people propose something like this as the solution:class Swap1 { public static void main(String args[]) { int a = 1; int b = 2; System.out.println("a +a); System.out.println("b +b); // swap a and b a = b; b = a; System.out.println("a +a); System.out.println("b +b); } } This produces the following output: a = 1 b = 2 a = 2 b = 2 That isn't what you expected! The problem is that we lost track of the value 1 when we put the value of b into a . To correct this we need to introduce a third variable, temp , to hold the original value of a . class Swap2 { public static void main(String args[]) { int a = 1; int b = 2; int temp; System.out.println("a +a); System.out.println("b +b); // swap a and b temp = a; a = b; b = temp; System.out.println("a +a); System.out.println("b +b); } } This code produces the output we expect: a = 1 b = 2 a = 2 b = 1
|
Bhopal news
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100