return midpt; else if (arr[midpt] < value) return else return find(arr,value, left, midpt-1); } void main(void) { int arr[] ={4,5,6,9,11}; cout<
Q: #include using namespace std; #define numVl 3 struct thNde { thNde* parent; int…
A: The code is written in C++ but instead of cout used printf for printing the outputs in code. Some…
Q: Write a small matrix library The library should have the following functions: double…
A: here in the question ask for a code for given functionality . i have provided my logic in c++…
Q: 3, Consider the code #define row 3 #define col 4 main) int z[row][col] {1,2,3,4,5,6,7,8,9,10,11,12};…
A:
Q: #include #include using namespace std; void PrintSize(vector numsList) { cout intList (3);…
A: Include the necessary header files for input/output and vectors. Define a function "PrintSize" that…
Q: Copy the completed Assignment 1 to Assignment 2. Re-label comments as needed. Add this feature to…
A: The complete code is given below with output .
Q: Add a new built-in path command that allows users to show the current pathname list, append one…
A: Algorithm: Start the program. Display the current path. Get the path to be added. Display the path…
Q: Dessssssssssinclude using namespace std; int MSD(int n){ if(n == 0) return 0;…
A: The code you provided is incomplete and contains a syntax error. The last line of the main()…
Q: #include #include using namespace std; //hasHelpOption() definition int hasHelpOption(int argc,…
A: Your program gives the following warning on compilation: It is because the compiler can not tell…
Q: #include #include #include typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef…
A: #include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct…
Q: in c++ how would i turn the funcion that uses [] to pointer notation #include void condense(char…
A: C++ code using pointer notation : #include <bits/stdc++.h> void condense(char* s); //…
Q: // copystr is supposed to return a pointer to the copy of source string char copystr (const char*…
A: The code snippet in C which correctly copies the source to destination without resulting in an error…
Q: 5.23 LAB: Contains the character Write a program that reads an integer, a list of words, and a…
A: I have answered this question in step 2.
Q: SKELETON CODE IS PROVIDED ALONG WITH C AND H FILES. #include #include #include #include…
A: Below find the solution else { stack.push(current_visting); for (auto i = vertices[size].begin(); i…
Q: plz do not copy from chegg #include using namespace std; void WaitingTime(int processes[], int n,…
A: This is required code. See below steps for complete code.
Q: The main method in C which calls all the above functions is: #include int main(){ int s1[100],…
A: Code: #include <stdio.h>#include <stdlib.h>typedef struct node *nodeptr;typedef struct…
Q: C++ problem #include #include using namespace std; class node { public: string data;…
A: Here, you need to write code for 3 functions called printList(), removeLast() and addBack(). In…
Q: #include using namespace std; const int ROWS = 10; const int COLS = 10; int…
A: To swap the elements of odd rows between arrays A and B, you can modify the swap function as…
Q: C PROGRAM Implement the sortAscending Function #include void swap(int*, int*); void…
A: Assume the first element as the maximum value in the array. Iterate through the array to find an…
Q: What is the ouput of the following C code segmer void * T( void* me) { int s=0; for (int k=1; k<=me;…
A: It is defined as a powerful general-purpose programming language. It can be used to develop software…
Q: #include using namespace std; int binarySearch(int[], int, int, int); int main () { int…
A: #include<iostream>using namespace std;int main(){ int arr[10] = {16, 19, 20, 23, 45, 56,…
Q: include using namespace std; void DeleteElement(int *LA,int ITEM,int &N,int K){ for(int…
A: Please find the answer below
Q: C++ The programme below is in C language. Please help me convert the whole programme into C++…
A:
Q: PROGRAMMING LANGUAGE: C++ SUBJECT: OOP Task: Find errors in the following code and rewrite a…
A: There are two errors in this program. I have provided an explanation of both with the correction…
Q: 2.20 LAB: Hypotenuse Given two numbers that represent the lengths of a right triangle's legs (sides…
A: Introduction: The name "Hypotenuse" in mathematics derives from the Greek word hypoteinousa, which…
Q: #include using namespace std; const int ROWS = 10; const int COLS = 10; int…
A: Algorithm:Declare two 10x10 two-dimensional arrays A and B of type integerInitialize constants MIN…
Q: All of the Stack parameters for the functions in lab4c.c are pointers to the Stack structure.
A: #include <stdio.h> #include <stdlib.h> /* typical C boolean set-up */ #define TRUE 1…
Q: C PROGRAM Implement the sortDescending Function #include void swap(int*, int*); void…
A: NOTE: Student only asked to implement the sortDescending Function. So I can provide only the…
Q: #include #include using namespace std; void PrintSize(vector numsList) { cout intList (2);…
A: Import the required libraries i.e. iostream and vector. Declare a function called PrintSize which…
Q: #include #include typedef struct Number_struct { int num; } Number; void Swap(Number*…
A: Code: Swap Function void Swap(Number* numPtr1, Number* numPtr2) { int temp = numPtr1->num;…
Q: #include using namespace std; int binarySearch(int[], int, int, int); int main () { int arr[10] =…
A: Include the header files Declare the Global variable count and initialize it to 0 Declare the binary…
Q: int machineCompare1(struct machine* mac1, struct machine* mac2) { struct mac1; struct mac2;…
A: Answer: C Source Code: #include <stdio.h>#include <string.h> struct machine{ char…
Q: /*Line 1:*/ doublevalues[6] = {10, 20, 30, 40, 50, 60}; /*Line 2:*/ double* yalptr= values; /*Line…
A: NOTE: - There is error on line 1 the way of declaring and initializing an array is wrong.…
Q: C++ language. Using the coding prepared below, add and create the Undo last pop, Display undo list…
A: #include<iostream>#include<iomanip>#include<ctype.h> using namespace std; char…
Q: #include using namespace std; void insertElement(int* LA, int ITEM, int N, int K) { int J=N;…
A: Step 1:- Program Explanation:- 1.In this program, we insert element 6 at the index of 3 in the array…
Q: include using namespace std; int MSD(int n){ if(n == 0) return 0; int k =…
A: Understanding the Function of the CodeThe given C++ code is intended to find and output the Most…
Q: struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book…
A: Required code is as follows as provided in the next step:
Q: Question 37 public static void main(String[] args) { Dog[] dogs = { new Dog(), new Dog()}; for(int i…
A: The given code has a method call decision(), but there is no method definition of decision()…
Q: please convert to C language
A: Hi there, Please find your solution below, I hope you would find my solution useful and helpful.…
Q: Explain this c code in details. #include int main() { int max_weight_truck, n; scanf("%d",…
A: #include <stdio.h> int main() { int max_weight_truck, n; scanf("%d", &max_weight_truck);…
Q: int numArray[] = {50, 60, 70, 8, 9}; int *ptr1 = &numArray[3]; int *ptr2 = &numArray[1]; Is the…
A: The correct option is true. Explanation: In function prototype we insure that whenever we want to…
Q: Define: void multTable(int table][COL]); mulTable() generates a multiplication table. For example:…
A: The solution is provided below.
Q: #include using namespace std; #define SIZE 5 //creating the queue using array int A[SIZE];…
A: Given: Function to check if the Queue is empty? Function to check if the Queue is Full Function…
Q: Data Structure Using C++ (Queue) I Need To Edite This Code Like The Picture down please help me ::…
A: The ask is to do the following: - modify the given program to not read the time inputs from user. -…
Q: #include #include using namespace std; void PrintVectors(vector numsList) { unsigned int i;…
A: In this question, it is asked to edit the code statements to pass all the test cases. One of the…
Q: Consider the producer-consumer problem where the producer produces items to be consumed by the…
A: As you can see, the output is not what it is supposed to be. In the above case, what happened is,…
Q: Step 1: Write a search function called linkedlistSearch( ) that takes a number, traverse through a…
A: //Given node structure of a linked list class Node { public: int data; Node *pNext; };…
Q: Write a function to conduct input validation to secure the smallest buffer. You may call this…
A: Given: We have to write a function to conduct input validation to secure the smallest buffer. You…
![#include <iostream>
using namespace std;
int find(int arr[], int value, int left, int right)
{
int midpt = (left+right)/2;
if (left > right)
return -1;
if ( arr[midpt]
return midpt;
else if (arr[midpt] < value)
== value)
return
else
return find(arr,value, left,midpt-1);
}
void main(void)
{
int arr[] ={4,5,6,9,11};
cout<<find(ar,4,0,4)<<endl; /* displays 0 */
cout<<find(arr,9,0,4)<«endl; /* displays 3 */
cout<<find(arr,10,0,4)<<endl; /* displays -1 */
}
(a) find(arr, value, right, midpt+1)
(b) find(arr,value, midpt+1,right)
(c) find(arr,value, left,midpt+1)
(d) find(arr,value, right,midpt-1)
(e) find(arr,value, left, midpt](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9a327348-0739-4b75-b1c2-230f27a7ea0d%2Fd5a3f020-16c2-407c-a34f-eb5d5ca1498f%2F2ftcpb_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
- #include<bits/stdc++.h> using namespace std; void bubbleSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } int binarySearch(int arr[], int l, int r, int x, int& comp) { comp++; if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) { return mid; } if (arr[mid] > x) { return binarySearch(arr, l, mid - 1, x, comp); } return binarySearch(arr, mid + 1, r, x, comp); } return -1; } int main() { int Num[8192]; srand(time(NULL)); for (int i = 0; i < 8192; i++) { Num[i] = rand() % 10001; } clock_t starting_time = clock(); bubbleSort(Num, 8192); clock_t ending_time = clock(); clock_t result =…given code lab4 #include <stdio.h>#include <stdlib.h> /* typical C boolean set-up */#define TRUE 1#define FALSE 0 typedef struct StackStruct{int* darr; /* pointer to dynamic array */int size; /* amount of space allocated */int inUse; /* top of stack indicator - counts how many values are on the stack */} Stack; void init (Stack* s){s->size = 2;s->darr = (int*) malloc ( sizeof (int) * s->size );s->inUse = 0;} void push (Stack* s, int val){/* QUESTION 7 *//* check if enough space currently on stack and grow if needed */ /* add val onto stack */s->darr[s->inUse] = val;s->inUse = s->inUse + 1;} int isEmpty (Stack* s){if ( s->inUse == 0)return TRUE;elsereturn FALSE;} int top (Stack* s){return ( s->darr[s->inUse-1] );} /* QUESTION 9.1 */void pop (Stack* s){if (isEmpty(s) == FALSE)s->inUse = s->inUse - 1;} void reset (Stack* s){/* Question 10: how to make the stack empty? */ } int main (int argc, char** argv){Stack st1; init (&st1);…#include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef struct LINKED_STACK_NODE_s{LINKED_STACK_NODE next;void *data;} LINKED_STACK_NODE_t[1]; typedef struct LINKED_STACK_s{LINKED_STACK_NODE head;int count;} LINKED_STACK_t[1], *LINKED_STACK; typedef struct{int R;int C;} POS_t[1], *POS; LINKED_STACK stack_init();void stack_free(LINKED_STACK stack);void stack_push(LINKED_STACK stack, void *data);void *stack_pop(LINKED_STACK stack);void *stack_top(LINKED_STACK stack);int is_empty(LINKED_STACK stack); int is_empty(LINKED_STACK stack){return stack->head == NULL;} LINKED_STACK stack_init(){LINKED_STACK stack = (LINKED_STACK)malloc(sizeof(LINKED_STACK_t));if (stack == NULL){printf("\nproblem with initializing stack\n\n");return NULL;}stack->head = NULL;stack->count = 0;return stack;} void stack_free(LINKED_STACK stack){while (is_empty(stack) == 0){stack_pop(stack);}free(stack);}void…
- void writeEmpToFile(Employee *emp, FILE *f) { fwrite(&emp->salary, sizeof(emp->salary), 1, f); fwrite(&emp->yearBorn, sizeof(emp->yearBorn), 1, f); fwrite(emp->ssn, sizeof(char), SSN_SIZE, f); int len = strlen(emp->name) + 1; fwrite(&len, sizeof(int), 1, f); fwrite(emp->name, sizeof(char), len, f); } If you don't want to look at all the code then please help me get the other section done from this code that I will put right here directly in the post if you need context on what this code needs to work with you can click on the link below https://onlinegdb.com/nWSAIx8hCn#include #include #include #define SIZE 5 int nums [SIZE] = [5,0,6,1,2); int main() { int i; pid_t pid; pid= fork(); if (pid == 0) { for (i = 0; i 0) { wait (NULL); } for (i = 0; i < SIZE; i++) printf("PARENT: %d\n", nums [i] + 1); /* LINE Y */ return 0; From the above-given program, please state what will be the output at lines X and Y. Explanation in detail required for output at both lines X and Y.In C programming. How do I find the max and min values of the corressponding columns. #include <stdio.h>#include <math.h>#include <stdlib.h>#define NROWS 5#define NCOLS 5 int main(void){ int i,j, max, min, m, n; float M[NROWS][NCOLS], Mt[NROWS][NCOLS]; char key_hit; //Input the sizes printf("ROW size(1-5) : ");scanf("%d",&m); printf("Column size(1-5): ");scanf("%d",&n); //Size Check while(m>NROWS || n>NCOLS) { printf("Please re-enter the sizes. \n"); printf("Row size(1-5) : ");scanf("%d", &m); printf("Column size(1-5) : ");scanf("%d", &n); } //Input the Matrix Data for(i=0; i<m; i++) for(j=0; j<n; j++) { printf("M[%d][%d] = ", i,j); scanf("%f", &M[i][j]); } //Print the Matrix Data for(i=0; i<m; i++) { for(j=0; j<n; j++) { printf("%1.2f\t", M[i][j]); }…
- C++ ProgrammingActivity: Linked List Stack and BracketsExplain the flow of the main code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS int main(int argc, char** argv) { SLLStack* stack = new SLLStack(); int test; int length; string str; char top; bool flag = true; cin >> test; switch (test) { case 0: getline(cin, str); length = str.length(); for(int i = 0; i < length; i++){ if(str[i] == '{' || str[i] == '(' || str[i] == '['){ stack->push(str[i]); } else if (str[i] == '}' || str[i] == ')' || str[i] == ']'){ if(!stack->isEmpty()){ top = stack->top(); if(top == '{' && str[i] == '}' || top == '(' && str[i] == ')' ||…#include<iostream>using namespace std;const int rows=10;const int columns=10;int computer_board1[rows][columns];int computer_board2[rows][columns];int player_board[rows][columns];int x,y;void setboard(){for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){computer_board1[i][j]=0;player_board[i][j]=0;}}}void display_computer_board1(){cout<<"Computer's Board"<<endl;cout<<" 0 1 2 3 4 5 6 7 8 9 "<<endl;for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){if(j==0){cout<<i<<" ";}cout<<computer_board1[i][j]<<" "; }cout<<endl;}cout<<endl;}void display_player_board(){cout<<"Your Board"<<endl;cout<<" 0 1 2 3 4 5 6 7 8 9 "<<endl;for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){if(j==0){cout<<i<<" ";}cout<<player_board[i][j]<<" "; } cout<<endl;} }void place_player_ships(){for(int i=1;i<=15;i++){cout<<"Horizontal…briefly comment the code#include <stdio.h>#include <stdlib.h>/* ADJACENCY MATRIX int source,V,E,time,visited[20],G[20][20];void DFS(int i){int j;visited[i]=1;printf(" %d->",i+1);for(j=0;j<V;j++){if(G[i][j]==1&&visited[j]==0)DFS(j);}}int main(){int i,j,v1,v2;printf("\t\t\tGraphs\n");printf("Enter the no of edges:");scanf("%d",&E);printf("Enter the no of vertices:");scanf("%d",&V);for(i=0;i<V;i++){for(j=0;j<V;j++)G[i][j]=0;}/* creating edges :P */for(i=0;i<E;i++){printf("Enter the edges (format: V1 V2) : ");scanf("%d%d",&v1,&v2);G[v1-1][v2-1]=1; } for(i=0;i<V;i++){for(j=0;j<V;j++)printf(" %d ",G[i][j]);printf("\n");}printf("Enter the source: ");scanf("%d",&source);DFS(source-1);return 0;}
- C++ ProgrammingActivity: Linked List Stack and BracketsExplain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow #include "stack.h" #include "linkedlist.h" // SLLStack means Singly Linked List (SLL) Stack class SLLStack : public Stack { LinkedList* list; public: SLLStack() { list = new LinkedList(); } void push(char e) { list->add(e); return; } char pop() { char elem; elem = list->removeTail(); return elem; } char top() { char elem; elem = list->get(size()); return elem; } int size() { return list->size(); } bool isEmpty() { return list->isEmpty(); } };#include #include using namespace std; void PrintSize(vector numsList) { cout intList (3); PrintSize(intList); cin >> currval; while (currval >= 0) { } Type the program's output intList.push_back(currval); cin >> currVal; PrintSize(intList); intList.clear(); PrintSize(intList); return 0; 1 se mice with camScanner Check Next Input 1234-1 Output#include<iostream>using namespace std;const int rows=10;const int columns=10;int computer_board1[rows][columns];int computer_board2[rows][columns];int player_board[rows][columns];int x,y;void setboard(){for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){computer_board1[i][j]=0;player_board[i][j]=0;}}}void display_computer_board1(){cout<<"Computer's Board"<<endl;cout<<" 0 1 2 3 4 5 6 7 8 9 "<<endl;for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){if(j==0){cout<<i<<" ";}cout<<computer_board1[i][j]<<" "; }cout<<endl;}cout<<endl;}void display_player_board(){cout<<"Your Board"<<endl;cout<<" 0 1 2 3 4 5 6 7 8 9 "<<endl;for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){if(j==0){cout<<i<<" ";}cout<<player_board[i][j]<<" "; } cout<<endl;} }void place_player_ships(){for(int i=1;i<=15;i++){cout<<"Horizontal…
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)