This code find the largest and smallest values in array N(5,2). Max = N(1, 1): Min = N(1, 1) For I 1 To 5 For J=1 To 2 1....... 2-....... Next J, I 1-If N(I, J) > Max Then Max = N(1, 1) 2-1f N(I, J)< Min Then Min = N(1, 1) 1-If N(I, J) > Max Then Max = N(I, J) 2-1f N(I, J)< Min Then Min = N(I, J) 1-If N(I,J) > Max Then Max = N(I, J) 2-Else Min = N(I, J) 1-If N(1, 1) > Max Then Max = N(I, J) 2-lf N(1, 1) < Min Then Min = N(I, J)

This code find the largest and smallest values in array N(5,2). Max = N(1, 1): Min = N(1, 1) For I 1 To 5 For J=1 To 2 1....... 2-....... Next J, I 1-If N(I, J) > Max Then Max = N(1, 1) 2-1f N(I, J)< Min Then Min = N(1, 1) 1-If N(I, J) > Max Then Max = N(I, J) 2-1f N(I, J)< Min Then Min = N(I, J) 1-If N(I,J) > Max Then Max = N(I, J) 2-Else Min = N(I, J) 1-If N(1, 1) > Max Then Max = N(I, J) 2-lf N(1, 1) < Min Then Min = N(I, J)

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

What's the values of array x if n=5: void read(int xﬁ.int n) f L for(int 1=0:1
1. Asymptotics. Given an array A of n integers, you'd like to output a two-dimensional n x n array B in which B[i, j] = max {A[i], A[i + 1],..., A[j]} for each i < j. For i j the value of B[i, j] can be left as is. for i = 1,2, η for j = i + 1, n " Compute the maximum of the entries A[i], A[i + 1], , A[j]. Store the maximum value in B[i, j]. (a) Find a function of such that the running time of the algorithm is O(f(n)), and clearly explain why. (b) For the same function f argue that the running time of the algorithm is also (f(n)). (This establishes an asymptotically tight bound (f(n)).) (c) Design and analyze a faster algorithm for this problem. You should give an algorithm with running O(g(n)), where lim→∞ g(n)/f(n) = 0.
in C++ Given an array A and a positive integer k, the selection problem amounts to finding the largest element x ∈ A such that at most k elements of A are less than or equal to x, or nil if no such element exists. A simple way to implement it is as follows: SimpleSelection(A, k) 1 if k > A.length 2 return nil 3 else sort A in ascending order 4 return A[k] Write another algorithm that solves the selection problem by sorting (using selection and bubble sort) A. Also, illustrate the execution of the algorithm on the following input by writing its state at each main iteration. A = (29, 28, 35, 20, 9, 33, 8, 9, 11, 6, 21, 28, 18, 36, 1) k = 6
In searching an element in an array, linear search can be used, even though simple to implement, but not efficient, with only O(n) time complexity. Assuming the array is already in sorted order, modify the search function below, using a better algorithm, so the average time complexity for the search function is O(log n). include <iostream> using namespace std; int search(int al), int s, int v) { 1/ Modify below codes. for (int i = 0; i <s; i++) { if (a[i] = v) return i; return -1; int main() { int intArray:10] = { 5, 7, 8, 9, 10, 12, 13, 15, 20, 34); // Search for element '12' in 10-elements integer array. cout << search(intArray, 10, 12); // '5' will be printed out. // Search for element '35' in 10-elements integer array. cout << search(intArray, 10, 35); // '-1' will be printed out. // Index '-l' means that the element is not found. return 0;
the task is to find the Kth smallest element in the given array..
The algorithm below searches for the maximum in an input array A. Assume A is a random sequence containing n distinguishable real numbers, what is the probability for line #4 to be executed exactly once? (The phrase "random sequence" here means the n numbers can appear in any order with equal chance.) mymax(A, n) { 1: max = A[1]; 2: for i = 2:n 3: if A[i] > max 4: max = A[i); 5: end; 6: end; 7: return max; }
15. Consider the problem of finding the first position in which an array b occurs as a subsequence of an array a. Write two nested loops: let result undefined for (let i = 0; i < a.length - b.length; i++) { for (let j = 0; j < b.length; j++) { if (a[i+j] = b[j]) . . . } } Complete with labeled break and continue statements.
! docs.google.com. This code calculate the average of elements in each column of array T(5,3) and stored in array K(3). 1-...... 2-.. 3-.... S=S+T(I, J) Next I 4-...... 5-..... Next J * 1-For J = 1 To 3 2-S = 0 3-For I = 1 To 54- AV = S/ 5 5-K(J) = S 9:18 1-For J = 1 To 3 2-S = 0 3-For I = 1 To 54- AV = S/ 5 5-K(J) = AV 1-For J = 1 To 3 2-S = 0 3-For I = 1 To 54- AV = S/ 3 5-K(J) = AV 5 1-S 0 2-For J = 1 To 3 3-For I = 1 To 54- AV = S/ 5 5-K(J) = AV 1-For J = 1 To 5 2-S = 0 3-For I = 1 To 3 4- AV = S/ 5 5-K(J) = AV + ← G ↑
1. /15 points] Consider the following function: Func1(A, n) * A is an array of integers 1 80; 2 for m 1 to 10 do k Random(n); for i1 to do j1 while (jn) do ssA[A[j]; j2*j; 3 4 5 6 7 8 end end 10 11 end 12 return (s); (a) What is the asymptotic worst case running time of Func1? (b) What is the asymptotic expected running time of Func1? Justify your solution