-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathquicksort2.php
80 lines (63 loc) · 1.39 KB
/
quicksort2.php
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
<?php
/**
* @author: syed ashraf ullah
* date: 24/04/2020
* problem: https://www.hackerrank.com/challenges/quicksort2/problem
*
* Note: The original file reader code is incorrect. It took lot's of time find out the problem.
*
* $ar = array();
* for ($i=0; $i<$m; $i++) {
* fscanf($fp, "%d", $ar[$i]);
* }
*/
function quickSort($ar) {
if (sizeof($ar) <= 1 ){
return $ar;
}
$left = array();
$right = array();
$p = $ar[0];
$size = sizeof($ar);
for ($i=1; $i < $size; $i++) {
if ($p < $ar[$i]) {
$right[] = $ar[$i];
continue;
}
$left[] = $ar[$i];
}
return merge(quickSort($left),quickSort($right), $p);
}
function merge($left, $right, $p) {
$left[] = $p;
foreach ($right as $value) {
$left[] = $value;
}
foreach ($left as $value) {
echo $value.' ';
}
echo '<br>';
//web break
// echo PHP_EOL;
return $left;
}
/**
* Sample input #1
*/
// $ar = array(5, 8, 1, 3, 7, 9, 2);
// $ar = quickSort($ar);
// return;
$fp = fopen("php://stdin", "r");
fscanf($fp, "%d", $m);
// Note: This provided reading method is incorrect.
// $ar = array();
// for ($i=0; $i<$m; $i++) {
// fscanf($fp, "%d", $ar[$i]);
// }
$input = trim(fgets($fp));
$ar = explode(" ", $input);
foreach($ar as &$number){
$number = (int)$number;
}
quickSort($ar);
?>