- it
- 排序
void quick_sort(int arr
[], int L
, int R
)
{
if( L
<R
)
{
int i
=L
, j
=R
, tmp
=arr
[L
];
while( i
<j
)
{
while(i
<j
&& arr
[j
]>=tmp
)
j
--;
arr
[i
]=arr
[j
];
while(i
<j
&& arr
[i
]<=tmp
)
i
++;
arr
[j
]=arr
[i
];
}
arr
[i
]=tmp
;
quick_sort(arr
, L
, i
-1);
quick_sort(arr
, i
+1, R
);
}
}
void bubble_sort(int arr
[], int length
)
{
int i
, j
, tmp
;
for( i
=0; i
<length
-1; i
++ )
{
for( j
=i
+1; j
<length
; j
++ )
{
if( arr
[i
]>arr
[j
] )
{
tmp
=arr
[i
];
arr
[i
]=arr
[j
];
arr
[j
]=tmp
;
}
}
}
}
void rever(int arr
[], int L
, int R
)
{
int i
=L
, j
=R
;
int tmp
;
while( i
<j
)
{
tmp
=arr
[i
];
arr
[i
]=arr
[j
];
arr
[j
]=tmp
;
i
++;
j
--;
}
}
