#include using namespace std; int getMedian(int ar1[], int ar2[], int n) { int j = 0; int i = n - 1; while (ar1[i] > ar2[j] && j < n && i > -1) swap(ar1[i--], ar2[j++]); sort(ar1, ar1 + n); sort(ar2, ar2 + n); return (ar1[n - 1] + ar2[0]) / 2; } // Driver Code int main() { int ar1[] = { 1, 12, 15, 26, 38 }; int ar2[] = { 2, 13, 17, 30, 45 }; int n1 = sizeof(ar1) / sizeof(ar1[0]); int n2 = sizeof(ar2) / sizeof(ar2[0]); if (n1 == n2) cout << "Median is " << getMedian(ar1, ar2, n1); else cout << "Doesn't work for arrays" << " of unequal size"; getchar(); return 0; } PLEASE SOLVE THIS USING 'class' . Thanks a lot in advance:)

#include using namespace std; int getMedian(int ar1[], int ar2[], int n) { int j = 0; int i = n - 1; while (ar1[i] > ar2[j] && j < n && i > -1) swap(ar1[i--], ar2[j++]); sort(ar1, ar1 + n); sort(ar2, ar2 + n); return (ar1[n - 1] + ar2[0]) / 2; } // Driver Code int main() { int ar1[] = { 1, 12, 15, 26, 38 }; int ar2[] = { 2, 13, 17, 30, 45 }; int n1 = sizeof(ar1) / sizeof(ar1[0]); int n2 = sizeof(ar2) / sizeof(ar2[0]); if (n1 == n2) cout << "Median is " << getMedian(ar1, ar2, n1); else cout << "Doesn't work for arrays" << " of unequal size"; getchar(); return 0; } PLEASE SOLVE THIS USING 'class' . Thanks a lot in advance:)

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 12VE

See similar textbooks

Similar questions

in c language as soon as possible 3) give a randomly ordered array of n elements; partition the elements into two arrays such that the elements that are <= mode of the set is one subset and the elements> mode of the set in other subset thease subsets should be created with exact number of elements (use dynamic memory allocation techniques)
Computer Science Java Program Write a program in Java that takes in a user-submitted file that is a grid of 0s and 1s. Represent the grid as a two-dimensional array. Write a program that: a. computes the size of a group when a square in the group is given b. computes the numbers of different groups c. lists all groups Example: userInput.txt: 0 0 0 0 0 0 0 0 0 10 0 0 1 1 0 0 0 0 10 0 0 0 0 0 0 0 0 00 0 0 0 1 0 0 1 0 00 0 0 1 0 0 0 1 0 00 0 0 0 0 0 0 1 1 00 0 0 0 1 1 0 0 0 00 0 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 0 The program should output three things: The size of the group in which location specified by the user belongs. then if the user enters 1,2 the answer is 0 1,4 the answer is 2 3,4 the answer is 1 4,7 the answer is 4 The number of each size group Size Count 2 3 1 List of each group’s locations 1: (0,9) (1,9) 2: (1,3) (1,4) 3: (3,4) 4: (3,7) (4,7) (5,7) (5,8) 5: (4,3) 6: (6,4) (6,5)
Write the implementations of functionscopy1 and copy2 for copying strings. copy1 uses array index notation. copy2 uses Pointers andPointer Arithmetic.#include <stdio.h>#define SIZE 10void copy1(char* s1, const char* s2); // prototypevoid copy2(char* s1, const char* s2); // prototypeint main(void){char string1[SIZE]; // create array string1char *string2 = "Hello"; // create a pointer to a stringcopy1(string1, string2);printf("string1 = %s\n", string1);char string3[SIZE]; // create array string3char string4[] = "Good Bye"; // create an array containing a stringcopy2(string3, string4);printf("string3 = %s\n", string3);}void copy1(char* s1, const char* s2){//Implement copying string using array index notation}void copy2(char* s1, const char* s2){//Implement copying string using Pointers and Pointer Arithmetic }
Debug C language int element(int arr[], int num) { in i, ele; ele = arr[0]; for (i = 1; i < num; i++) if (arr[i] > ele) ele = arr[i]; return ele; } main() { arr[] = {1, 24, 145, 20, 8, -101, 300}; int n = sizeof(arr)/sizeof(arr[0]); printf("element of array is %d", element(arr[], n)); }
(C Language) The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1.
In C++ Create an array of head pointers, statically allocated of size 101 of that type: Now, create a pointer that can point to the first element: Show how to dynamically allocate an array of 101 elements of head pointers: Write the code to initialize each element to NULL: Rewrite the code to initialize each element to NULL using pointer arithmetic:
Program in C language (Please solve part 2) Part one : Write a program that does the following: Creates int array array_1 of length 10. Creates int array array_2 of length 10. Takes int values from the user of for 10 values for array_1 and array_2, each. Creates a new int array array_3 which copies the values of array_1 and array_2, in interleaved order, into it. Prints out the contents of Prints out the contents of array_1, array_2 and array_3. Part two : Repeat Part one, but this time use arrays of char (instead of int), and stop receiving input into array_1 and array_2 when the user hits Enter / newline and insert a Null character into the array
Modified Recursive Binary Search • Write C++ program hw7.cpp that meets the following requirements: – First, write a recursive binary search function with the following prototype: int binarySearch(int array[], int first, int last, int value); – Now suppose we have a sorted array like this: int a[SIZE] = { 3, 5, 7, 9, 22, 22, 22, 22, 30, 35, 51, 52, 73 }; – Then the following statement int index = binarySearch(a, 0, SIZE-1, 22); – would return one of the indices that match the target value (22), and it could be index 4, 5, 6, or 7. – Now, your mission is to modify this recursive binary search function to always return the leftmost index when there are multiple indices that match the target value. Thus, in the above case, the function must return index 4. – If no match found, the function returns -1. – Write a main function that checks if your modified binary search function works as expected with at least 3 example arrays. – Note: your modified binary search function must ensure the…
Implement in C Program 5.20 LAB: Word frequencies Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain fewer than 20 words, and each word contains fewer than 10 characters. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey - 1 hi - 2 Mark - 1 hi - 2 mark - 1 Hint: Use two arrays, one array for the strings and one array for the frequencies. #include <stdio.h>#include <string.h> int main(void) { /* Type your code here. */ return 0;}
Using comments in c explaining how each code works line by line. The whole program is given below. Don't delete anything. For example // #include calls upon the c library #include #define N 16 typedef int fix_matrix[N][N]; /* Set all diagonal elements to a[i] + val */ void fix_set_diag(fix_matrix A, int val) { for( int i=0;i
Single number (use XOR): Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Code in Java A brief explanation of how and why your code works and how it relates to the concepts learned (for example, it uses bitwise operation, stack, or takes into account a word size).
Write in Java (Data Structures). Write a program that implements a selection sort of an array of numbers 50 to 70. Program needs to... 1: One-by-one, move boundary of an unsorted array of numbers. 2: Find the minimum element in the unsorted array 3: Swap the found minimum element with the first element. 4: Print out the array of numbers sorted. Add comments to describe what the code is doing.