PHP bubble sorting binary search sequence query two-dimensional array sorting algorithm function details

This article provides a detailed analysis of PHP bubble sorting binary search sequence query two-dimensional array sorting algorithm functions. it is important for a friend to refer to the data structure, algorithm + data structure + document = program
Describes the bubble sorting algorithm using PHP. the object can be an array.

The code is as follows:

// Bubble sort (array sorting)
Function bubble_sort ($ array ){
$ Count = count ($ array );
If ($ count <= 0)
Return false;
For ($ I = 0; $ I <$ count; $ I ++ ){
For ($ j = $ count-1; $ j> $ I; $ j -){
If ($ array [$ j] <$ array [$ j-1]) {
$ Tmp = $ array [$ j];
$ Array [$ j] = $ array [$ j-1];
$ Array [$ j-1] = $ tmp;
}
}
}
Return $ array ;}

Using PHP to describe sequential search and binary search (also called semi-query) algorithms, the efficiency of sequential search must be considered. the object can be an ordered array.

The code is as follows:

// Binary search (find an element in the array)
Function bin_sch ($ array, $ low, $ high, $ k ){
If ($ low <= $ high ){
$ Mid = intval ($ low + $ high)/2 );
If ($ array [$ mid] === k ){
Return $ mid;
} Elseif ($ k <$ array [$ mid]) {
Return bin_sch ($ array, $ low, $ mid-1, $ k );
} Else {
Return bin_sch ($ array, $ mid + 1, $ high, $ k );
}
}
Return-1;
}
// Sequential search (find an element in the array)
Function seq_sch ($ array, $ n, $ k ){
$ Array [$ n] = $ k;
For ($ I = 0; $ I <$ n; $ I ++ ){
If ($ array [$ I] === k ){
Break;
}
}
If ($ I <$ n ){
Return $ I;
} Else {
Return-1;
}
}

Write a two-dimensional array sorting algorithm function that is universal and can call php built-in functions

The code is as follows:

// Two-dimensional array sorting. $ arr indicates data, $ keys indicates the key value of sorting, $ order indicates sorting rules, 1 indicates ascending, and 0 indicates descending.
Function array_sort ($ arr, $ keys, $ order = 0 ){
If (! Is_array ($ arr )){
Return false;
}
$ Keysvalue = array ();
Foreach ($ arr as $ key => $ val ){
$ Keysvalue [$ key] = $ val [$ keys];
}
If ($ order = 0 ){
Asort ($ keysvalue );
} Else {
Arsort ($ keysvalue );
}
Reset ($ keysvalue );
Foreach ($ keysvalue as $ key => $ vals ){
$ Keysort [$ key] = $ key;
}
$ New_array = array ();
Foreach ($ keysort as $ key => $ val ){
$ New_array [$ key] = $ arr [$ val];
}
Return $ new_array;
}