[C/C ++] Bubble sorting and binary search, bubble binary

[C/C ++] Bubble sorting and binary search, bubble binary

Bubble Sorting: Compares two adjacent numbers. If a> B (or a <B) is used, the exchange value is used. Each time, the maximum (or minimum) value is pushed back.

Binary Search: Compare the value of a and B in the middle of each header and tail. If a> B indicates that the value of B is in front of the middle subscript, the head points to the first digit in the middle; if a <B indicates that the target value B is behind the intermediate subscript, the end is directed to the next digit of the intermediate downlink. If a = B, the intermediate subscript is returned. -1 is returned if the search fails.

1. Initialize an array of the specified length at random.

2. Sort the array.

3. Enter a value and search for the subscript in the array.