"C + +" bubble sort and two-point lookup

Bubble sort: Is the comparison of the two adjacent numbers, if a>b (or a<b) Exchange values, each time a maximum (or minimum) value is pushed backwards.

Binary lookup: Each time the middle of the head and tail is compared with the target value B, if a>b indicates that the target value B is in front of the middle subscript, the head points to the front of the middle subscript; if a<b indicates that the target value B is after the middle subscript, the tail points to the bottom of the middle subscript; if a== b returns the intermediate subscript. Lookup failed to return-1.

1. Randomly initialize an array of a specified length.

2. Sort the array.

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

"C + +" bubble sort and two-point lookup