Shell script programming (quick sorting)

Shell script programming (quick sorting)
[Cpp] view plaincopy

1. #! /Bin/bash
2. # Implementation of fast sorting in shell script programming (using the rightmost element as the element)
3. A = (851032934123409618629)
4. # A = (00001233448283049592143716)
5. Temp =
6. Buff =
8. # Switching functions
9. Swap ()
10. {
11. Buff =$ {a [$1]}
12. A [$1] =$ {a [$2]}
13. A [$2] = $ buff
14. }
16. Fun ()
17. {
18. I = $($1-1 ))
19. J = $1
20. Temp =$ {a [$2]}
21. Iftest $ 1-ge $2; then
22. Return2
23. Fi
24. While [$ j-le $2]; do
25. [$ J-lt $2] & while [[$ {a [$ j]}-gt $ temp]; do
26. J = $ ($ j + 1 ))
27. Done
28. I = $ ($ I + 1 ))
29. Swap $ I $ j
30. J = $ ($ j + 1 ))
31. Done
32. Fun0 $ ($ i-1 ))
33. Fun $ ($ I + 2) $2
34. }
35. Fun015
36. For (I = 0; I <16; I ++ ))
37. {
38. Echo-n $ {a [$ I]} ""
39. }
40. Echo
41. Exit0

The following is the comparison code of C ++ quick sorting.

[Cpp] view plaincopy

1. # Include <iostream>
2. Usingnamespacestd;
4. Voidswap (int * a, int * B)
5. {
6. Inttemp = *;
7. * A = * B;
8. * B = temp;
9. }
10. VoidGrial (inta [], intx, inty)
11. {
12. Inti = X-1;
13. Intj = x;
14. If (x> = y) return;
15. Inttemp = a [y];
16. While (j <= y)
17. {
18. While (j <y & a [j]> a [y])
19. J ++;
20. I ++;
21. Swap (& a [I], & a [j]);
22. J ++;
23. }
24. Grial (a, 0, I-1 );
25. Grial (a, I + 1, y );
26. }
27. Intmain ()
28. {
29. Inta [] = };
30. Grial (a, 0, 14 );
31. For (inti = 0; I <15; I ++)
32. {
33. Cout <a [I] <"";
34. }
35. Cout <endl;
36. }