Write a program that sorts a given array by using Bubble Sort. Then, find out the index of the input number by using Binary Search. ** Array length is fixed as 10 and each element is integer and in [0, 99] • Function Prototype • void bobble_sort(int* randList) - sort an array( randlist ) using bubble sort. int binary_search(int num, int" randlist, int low, int high) - If you found a input number in an array, return the index of that number. Else return -1. • void step_printer - print each step of binary search. You MUST show all the binary search steps on your program as shown as below. Example) > Input array:88 84 48 40 39 37 20 19 13 4 Input number:25 Sorted array:4 13 19 20 37 39 40 48 84 88 Binary Search step:4 13 19 20 Binary Search step:19 20 Binary Search step:20 NOT FOUND! > Input array:4 88 13 84 19 48 20 40 39 37 Input number:19 Sorted array:4 13 19 20 37 39 40 48 84 88 Binary Search step:4 13 19 20 Binary Search step:19 20 19 is in the randList[2]!
Write a program that sorts a given array by using Bubble Sort. Then, find out the index of the input number by using Binary Search. ** Array length is fixed as 10 and each element is integer and in [0, 99] • Function Prototype • void bobble_sort(int* randList) - sort an array( randlist ) using bubble sort. int binary_search(int num, int" randlist, int low, int high) - If you found a input number in an array, return the index of that number. Else return -1. • void step_printer - print each step of binary search. You MUST show all the binary search steps on your program as shown as below. Example) > Input array:88 84 48 40 39 37 20 19 13 4 Input number:25 Sorted array:4 13 19 20 37 39 40 48 84 88 Binary Search step:4 13 19 20 Binary Search step:19 20 Binary Search step:20 NOT FOUND! > Input array:4 88 13 84 19 48 20 40 39 37 Input number:19 Sorted array:4 13 19 20 37 39 40 48 84 88 Binary Search step:4 13 19 20 Binary Search step:19 20 19 is in the randList[2]!
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
c
input code in "enter code here"
![Write a program that sorts a given array by using
Bubble Sort. Then, find out the index of the input number by using
Binary Search.
** Array length is fixed as 10 and each element is integer and in [0,
99]
• Function Prototype
• void bobble_sort(int" randList) - sort an array( randList ) using
bubble sort.
• int binary_search(int num, int" randlist, int low, int high) - If you
found a input number in an array, return the index of that
number. Else return -1.
• void step_printer - print each step of binary search.
You MUST show all the binary search steps on your program as shown
as below.
Example)
> Input array:88 84 48 40 39 37 20 19 13 4
Input number:25
Sorted array:4 13 19 20 37 39 40 48 84 88
Binary Search step:4 13 19 20
Binary Search step:19 20
Binary Search step:20
NOT FOUND!
Input array:4 88 13 84 19 48 20 40 39 37
Input number:19
Sorted array:4 13 19 20 37 39 40 48 84 88
Binary Search step:4 13 19 20
Binary Search step:19 20
19 is in the randList[2]!](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F300b1fc5-2fff-487f-af38-550515adf9e8%2F85e4294a-2117-4005-8a8b-3a157d79ce56%2F719shn_processed.png&w=3840&q=75)
Transcribed Image Text:Write a program that sorts a given array by using
Bubble Sort. Then, find out the index of the input number by using
Binary Search.
** Array length is fixed as 10 and each element is integer and in [0,
99]
• Function Prototype
• void bobble_sort(int" randList) - sort an array( randList ) using
bubble sort.
• int binary_search(int num, int" randlist, int low, int high) - If you
found a input number in an array, return the index of that
number. Else return -1.
• void step_printer - print each step of binary search.
You MUST show all the binary search steps on your program as shown
as below.
Example)
> Input array:88 84 48 40 39 37 20 19 13 4
Input number:25
Sorted array:4 13 19 20 37 39 40 48 84 88
Binary Search step:4 13 19 20
Binary Search step:19 20
Binary Search step:20
NOT FOUND!
Input array:4 88 13 84 19 48 20 40 39 37
Input number:19
Sorted array:4 13 19 20 37 39 40 48 84 88
Binary Search step:4 13 19 20
Binary Search step:19 20
19 is in the randList[2]!
![#include <stdio.h
#define SIZE 10
void bobble_sort(int* randlist)(
for (unsigned int 1 - 8; 1 < SIZE-1; +1) {
for (unsigned int j- B; 1 < SIZE-1-1; +1) {
if (alj] > alj+1]) {
int hold - aljl;
eljl - alj+1];
alj+1] - hold;
void step_printer(int *randlist, int low, int high){
II Enter code here
int binary_search(int num, int+ randList, int low, int high){
/I Enter code here
raturn -1;
int main(){
int num e;
int randlist[SIZE];
int flag:
printf("Input array:");
for( int 1- 0; 1 « SIZE; 1+ )
scanf ("sd", Arandlist(1]):
printf("Input number:");
scanf ("zd", Enum);
bobble_sort( randlist ):
printf("Sorted array:");
for( int 1 - B; 1 < SIZE; 1++ )
printf("zd ", randList[1]);
puts(");
flag - binary_search( num, randlList, 8, SIZE - 1 );
if( flag -1)
printf("NOT FOUNDI");
OSTO
printf("zd 1s in the randList[d]!", num, flag):
return B:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F300b1fc5-2fff-487f-af38-550515adf9e8%2F85e4294a-2117-4005-8a8b-3a157d79ce56%2Fwqd3en4_processed.png&w=3840&q=75)
Transcribed Image Text:#include <stdio.h
#define SIZE 10
void bobble_sort(int* randlist)(
for (unsigned int 1 - 8; 1 < SIZE-1; +1) {
for (unsigned int j- B; 1 < SIZE-1-1; +1) {
if (alj] > alj+1]) {
int hold - aljl;
eljl - alj+1];
alj+1] - hold;
void step_printer(int *randlist, int low, int high){
II Enter code here
int binary_search(int num, int+ randList, int low, int high){
/I Enter code here
raturn -1;
int main(){
int num e;
int randlist[SIZE];
int flag:
printf("Input array:");
for( int 1- 0; 1 « SIZE; 1+ )
scanf ("sd", Arandlist(1]):
printf("Input number:");
scanf ("zd", Enum);
bobble_sort( randlist ):
printf("Sorted array:");
for( int 1 - B; 1 < SIZE; 1++ )
printf("zd ", randList[1]);
puts(");
flag - binary_search( num, randlList, 8, SIZE - 1 );
if( flag -1)
printf("NOT FOUNDI");
OSTO
printf("zd 1s in the randList[d]!", num, flag):
return B:
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY