phpStudyCode/DivideConquerSort.php at master · luolaifa000/phpStudyCode · GitHub

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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
<?php
function pre($arr)
{
    $data = func_get_args();
    foreach($data as $key=>$val)
    {
        echo '<pre>';
        print_r($val);
        echo '</pre>';
    }
}

function prend()
{
    $data = func_get_args();
    foreach($data as $key=>$val)
    {
        echo '<pre>';
        print_r($val);
        echo '</pre>';
    }
    exit();
}
/**
 * 分治归并排序
 * 基本思想是 先将数组分成一个个不能在分的集合，然后在按顺序合并各个集合
 * 时间复杂度 = O（nlogn）
 * @author yumancang
 *
 */
class DivideConquerSort
{
    /**
     * 整数数组
     * @var array
     */
    public $data = [];

    public function __construct($array)
    {
        $this->data = $array;

    }

    /**
     * 升序分开
     *
     * @param int $start
     * @param int $end
     */
    public function ascSort(int $start,int $end)
    {
        if ($start < $end) {
            $mid = floor(($start+$end)/2);
            $this->ascSort($start, $mid);
            $this->ascSort($mid+1, $end);
            $this->ascMerge($start,$mid,$end);
        }

    }
    /**
     * 升序合并
     *
     * @param int $start
     * @param int $end
     */
    public function ascMerge(int $start, int $mid, int $end)
    {

        $i = $start;
        $j = $mid+1;
        $temp = [];
        while (true) {
            if ($i > $mid) break;
            if ($j > $end) break;
            if ($this->data[$i] < $this->data[$j]) {
                $temp[] = $this->data[$i];
                $i++;
            }
            if ($this->data[$i] > $this->data[$j]) {
                $temp[] = $this->data[$j];
                $j++;
            }
        }
        if ($i < $mid+1) {
            while ($i < $mid+1) {
                $temp[] = $this->data[$i];
                $i++;
            }
        }
        if ($j < $end+1) {
            while ($j < $end+1) {
                $temp[] = $this->data[$j];
                $j++;
            }
        }
        $m = 0;
        for ($k = $start; $k <=$end; $k++) {
            $this->data[$k] = $temp[$m++];
        }
    }

    /**
     * 升序分治
     *
     */
    public function ascDivideConquerSort()
    {
        pre($this->data);

        $this->ascSort(0,count($this->data) - 1);
        pre($this->data);
    }

    /**
     * 降序分治
     *
     */
    public function descDivideConquerSort()
    {
        pre($this->data);

        $this->descSort(0,count($this->data) - 1);
        pre($this->data);
    }

    /**
     * 降序分开
     *
     * @param int $start
     * @param int $end
     */
    public function descSort(int $start,int $end)
    {
        if ($start < $end) {
            $mid = floor(($start+$end)/2);
            $this->descSort($start, $mid);
            $this->descSort($mid+1, $end);
            $this->descMerge($start,$mid,$end);
        }

    }

    /**
     * 降序合并
     *
     * @param int $start
     * @param int $mid
     * @param int $end
     */
    public function descMerge(int $start, int $mid, int $end)
    {

        $i = $start;
        $j = $mid+1;
        $temp = [];
        while (true) {
            if ($i > $mid) break;
            if ($j > $end) break;
            if ($this->data[$i] < $this->data[$j]) {
                $temp[] = $this->data[$j];
                $j++;
            }
            if ($this->data[$i] > $this->data[$j]) {
                $temp[] = $this->data[$i];
                $i++;
            }
        }

        if ($i < $mid+1) {
            while ($i < $mid+1) {
                $temp[] = $this->data[$i];
                $i++;
            }
        }
        if ($j < $end+1) {
            while ($j < $end+1) {
                $temp[] = $this->data[$j];
                $j++;
            }
        }
        $m = 0;
        for ($k = $start; $k <=$end; $k++) {
            $this->data[$k] = $temp[$m++];
        }
    }
}

$start = memory_get_usage();

$bubble = new DivideConquerSort([7,3,2,4,6,9,5,8]);
//$bubble->ascInsertSort();
//$bubble->ascDivideConquerSort();
$bubble->descDivideConquerSort();
$end = memory_get_usage();
prend(($end-$start)/1024/1024);

?>