#include int midterm(int array|], int n, int x) { for (int i = 0; i< n; i++) if (arrayli] =x) return i return -1 int main() { int array[ ] = {2, 4, 0, 1, 9, 5, 3, 7} int x=7 int n= sizeof(array) / sizeof(array[0]) int result = midterm(array, n, x) (result =-1) ? printf("Element not found") : printf("Element found at index: %d", result)

#include int midterm(int array|], int n, int x) { for (int i = 0; i< n; i++) if (arrayli] =x) return i return -1 int main() { int array[ ] = {2, 4, 0, 1, 9, 5, 3, 7} int x=7 int n= sizeof(array) / sizeof(array[0]) int result = midterm(array, n, x) (result =-1) ? printf("Element not found") : printf("Element found at index: %d", result)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

I need this program in java please. #Given Arrayarray=[1,1,1,2,2,2,2,2,4,5,5,6,6,6] #Insert valuevalue=3 index=0for x in array: if value<x: #inserting to the array in the position index array.insert(index,value) print ("Output :",array) break #Incrementing position by 1 index=index+1
5. Implement the binary search function below that returns the index of the target value in an integer array. int search(int a[], int t, int l, int r); Given the binary search function in question 5 and the array a below, list all activations when calling search(a, 19, 0 15). -9 -5 -2 0 1 3 7 11 17 19 21 25 27 31 37 41 a index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Write a program to shift all the zero present in the array in the alternative order, For example.Input array: -1 2 0 8 5 0 0 6Output array: -1 0 2 8 0 5 0 6Sample Input:First input should describe the number of elements in the array and in the second line take all the input. 50 1 2 0 3Output: -1 0 2 0 3
Implement the function below. void swap(int pos1, int pos2){} Initial code to be completed: class ArrayList : public List { int* array; int index; int capacity; void dyn_all_add(){ int cap = ceil(capacity * 1.5); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } void dyn_all_rem(){ int cap = capacity - (capacity/3); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } public: // CONSTRUCTOR ArrayList() { capacity = 4; array = (int*)malloc(capacity); index = 0; } int add(int num) { if (index == capacity){ dyn_all_add(); } *(array + index) = num; index++; return index; } int get(int pos){ if (pos-1 < index){ return *(array + pos-1); } return -1; } int size(){ return index; }…
Write a code in C++ / cpp to solve the following problem Sasha has an array that contains each number between 1\dots n1…n exactly once. Sasha wants to pick these numbers from 11 to nn in increasing order. On each step, she goes through the array from left to right and picks as many numbers as possible. What will be the total number of steps? Input The first input line has an integer n: the array size. The second line has n integers x1,x2,…,xn: the numbers in the array. Constraints: 1 <= n <= 2*10^5 Output Print one integer: the number of steps. Sample 1 Input 54 2 1 5 3 Output 3
Write a program in ¢++ that asks the user to enter 10 integers of an array . The program must return the position pointer of an element that is equal to the square of another element.and then print the array example:- array={2.6,8,4,5} ------- 1 is squar of 2 position=3
Q) Write an assembly language program that scans an array and gives a count of maximum number of consecutive zeros in an array. For example, for the following array, the answer is 5, Array size is not given however, Array ends with -1. All other array values are >= 0. My_array[] = {0, 1, 0, 0, 5, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 4, 5, 6, 0, 0, 1, -1};The answer for this example array is 5. The answer should be sent to PORTB. First write C code and convert that to Assembly, line by line.
C++ Given an array of n positive integers you need to print the smallest possible sub-arraywhose sum is equal to a positive integer m. If there is no possible subarray, then print -1 Expected Runtime Complexity – O(N) where N is the size of an array. Enter n:10Enter elements of an array (positive numbers):2 5 1 3 5 2 1 3 4 2Enter m:10Output:Yes3 5 2
Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
Write a C program that reads in an array of integers of size n (n <= 100) from the user and prints out the largest subarray of consecutive integers in the array. For example, if the user enters the array [3, 4, 5, 1, 2, 3, 6, 7], the program should output "Largest subarray of consecutive integers: [3, 4, 5]".
First, write a Java method merge that takes as parameter a non-empty double array representing employees’ salaries. The method merges the values of every 2 adjacent elements. put the merged values at the beginning of the array, and put 0 in the remaining positions. Suppose that the original array will contain an even number of elements. Second, write two java methods readArray(int[]a) and printArray(int[]a) that reads/writes the elements of an array passed in parameter from/to the standard input/output. Finally, Use the following main method to test your different methods: public class MergeSalary { private static Scanner input = new Scanner(System.in); public static void main(String[] args) { } } double[] salaries = new double[10]; System.out.print("Enter 10 salaries: "); readArray(salaries); merge(salaries); System.out.print("Salaries after merge: "); printArray(salaries); Hint: For the method merge, you can work on the same array or use a temporary array. Run example:…
First, write a Java method merge that takes as parameter a non-empty double array representing employees’ salaries. The method merges the values of every 2 adjacent elements. put the merged values at the beginning of the array, and put 0 in the remaining positions. Suppose that the original array will contain an even number of elements. Second, write two java methods readArray(int[]a) and printArray(int[]a) that reads/writes the elements of an array passed in parameter from/to the standard input/output. Finally, Use the following main method to test your different methods: