Hi, can you give me a hand with this exercise. thanks! Binary Bubbles. Create an array full of 11 integers which the user will generate. assume that the values will be between -100 and +100. Then, using the sorting algorithm called BubbleSort, put the array in the correct order (from lowest to highest number). After this, please print the array to the screen. Finally, search the array for the target value using Binary Search. The BinarySearch code will implement the algorithm described below: int low = 0, mid = 0; int high = arraySize; bool found = false; while (high >= low) { mid = (low + high) / 2; if (find < searchArray[mid]) { high = mid - 1; } else if (find == searchArray[mid]) { found = true; break; } else low = mid + 1; } Print out a few key values which help Binary Search function. For example, this algorithm focuses on a low, mid, and high which correspond to the indices in the array the algorithm is currently considering and searching. Printing these values during the search process will help with debugging and fixing any issues. • BubbleSort sorts the array to prepare for the next step • BinarySearch searches the now sorted array to determine if the target value is in the array or not. The user input is indicated in bold. Sample output #1 Please enter 11 numbers: Integer 1: 15 Integer 2: 12 Integer 3: 89 Integer 4: -14 Integer 5: 11 Integer 6: -99 Integer 7: 1 Integer 8: 42 Integer 9: 27 Integer 10: 2 Integer 11: 67 What is the target number : 42 The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89 Low is 0 High is 10 Mid is 5 Searching Low is 6 High is 10 Mid is 8 Searching The target is in the set. Sample output #2 What is the target number: -5 The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89 Low is 0 High is 10 Mid is 5 Searching Low is 0 High is 4 Mid is 2 Searching Low is 0 High is 1 Mid is 0 Searching The target is not in the set.
Hi, can you give me a hand with this exercise. thanks!
Binary Bubbles. Create an array full of 11 integers which the user will generate. assume that the values will be between -100 and +100. Then, using the sorting
The BinarySearch code will implement the algorithm described below:
int low = 0, mid = 0;
int high = arraySize;
bool found = false;
while (high >= low)
{
mid = (low + high) / 2;
if (find < searchArray[mid]) {
high = mid - 1;
}
else if (find == searchArray[mid]) {
found = true; break;
}
else low = mid + 1;
}
Print out a few key values which help Binary Search function. For example, this algorithm
focuses on a low, mid, and high which correspond to the indices in the array the algorithm is
currently considering and searching.
Printing these values during the search process will help with debugging and fixing any issues.
• BubbleSort sorts the array to prepare for the next step
• BinarySearch searches the now sorted array to determine if the target value is in the array or not.
The user input is indicated in bold.
Sample output #1
Please enter 11 numbers:
Integer 1: 15
Integer 2: 12
Integer 3: 89
Integer 4: -14
Integer 5: 11
Integer 6: -99
Integer 7: 1
Integer 8: 42
Integer 9: 27
Integer 10: 2
Integer 11: 67
What is the target number : 42
The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89
Low is 0
High is 10
Mid is 5
Searching
Low is 6
High is 10
Mid is 8
Searching
The target is in the set.
Sample output #2
What is the target number: -5
The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89
Low is 0
High is 10
Mid is 5
Searching
Low is 0
High is 4
Mid is 2
Searching
Low is 0
High is 1
Mid is 0
Searching
The target is not in the set.
Step by step
Solved in 3 steps with 1 images
