We learned from mathematics that addition is commutative (i.e. a+b = b+a) and associative (i.e. (a + b) + c = a + (b + c)). Consider the expression in which the n elements of the array A is a numeric type. A[0] + A[1] + ... + A[n-1]; If A is an array of integers, is the result the same if the expression above is evaluated in any order (using properties of commutativity and associativity)? Why or why not?

We learned from mathematics that addition is commutative (i.e. a+b = b+a) and associative (i.e. (a + b) + c = a + (b + c)). Consider the expression in which the n elements of the array A is a numeric type. A[0] + A[1] + ... + A[n-1]; If A is an array of integers, is the result the same if the expression above is evaluated in any order (using properties of commutativity and associativity)? Why or why not?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Given an array, find the total number of inversions of it. If (i < j) and (A[i] > A[j]), then pair (i, j) is called an inversion of an array A. We need to count all such pairs in the array. For example, Input: A[] = [1, 9, 6, 4, 5] Output: The inversion count is 5 There are 5 inversions in the array: (9, 6), (9, 4), (9, 5), (6, 4), (6, 5)
You are given an integer array X[1, . . . , n]. You should move each element of X[1, . . . , n] into one of the two arrays A and B such that A and B are non-empty and average(A) = average(B). Return true if it is possible to achieve that and false otherwise. Note that for an array A, average(A) is the sum of all the elements of A over the length of A. Precisely define the subproblem.Provide the recurrence equation.Describe the algorithm in pseudocode to compute the optimal value.Describe the algorithm in pseudocode to print out an optimal solution.
Write a function that gets an array of ints of length n, and a number k, and returns the longest subsequence of consecutive k’s in the array. For example - On input ([1, 1, 3, 3, 3, 1, 5, 1], 1), the function returns 3 - On input ([1, 3, 3, 2, 3, 3, 3, 3], 3), the function returns 4 - On input ([3, 5, 2, 5, 2, 5, 5], 3), the function returns 2 - On input ([1, 2, 3, 3, 3, 3], 5), the function returns 0 // returns the length of the longest subsequence // of consecutive k’s in the array int longest_seq(const int* ar, int n, int k); test for the function: void test_q1() { inta1[] = {1, 1, 3, 3, 3, 1, 5, 1}; if (longest_seq(a1, 8, 1) == 2) printf("Q1-1 ok\n"); else printf("Q1-1 ERROR\n"); inta2[] = {1,3,3,2,3,3,3,3}; if (longest_seq(a2, 8, 3) == 4) printf("Q1-2 ok\n"); else printf("Q1-2 ERROR\n"); }
write a c program for this: A run is a sequence of adjacent repeated values. Compute the length of the longest run in an array. For example, the longest run in the array with elements 1 2 5 5 3 1 2 4 3 2 2 2 2 3 6 5 5 6 3 1 has length 4.
can you solve this please ? Given an array of unsorted integers, you are requested to investigate whether there exist a pair of numbers in this array that has a sum equal to a given key or not. For example, if the arr = [8, 7, 2, 5, 3] and the key = 12, the answer will be "Yes" as the array has a pair (7 and 5) where their sum = 12 = key, otherwise "No" is returned. To solve this problem, the following idea can be used: i. Consider every pair in the given array and check if their sum = key. ii. Sort the array first, keeping two pointers to on the minimum and maximum of the array and then move from both directions toward the center of the array while checking whether the sum = key or not. Answer the following questions: a) Transform each of the above ideas (i) & (ii) into algorithm (pseudocode) and compute their complexities b) Critic these two ideas: [Which is better? Why?] c) Design a better solution with less complexity. [note: your idea should be…
Please use a different code to solve this question Given an string representing a 2D array of integers that contains the locations of the two skyscrapers, find the shortest possible path that connects the two skyscrapers and return the length of that path. A skyscraper is defined to be a 4-directionally connected group i.e. North-South-East-West, no diagonals), and can consist of multiple "parts" such that the initial size of the skyscraper is not one single cell. 1's represent a cell that is part of the skyscraper, and 0's represent cells that are empty air. You will join the path to the other skyscraper by adding planks to spots containing 0's where each cell represents one unit of distance. You can only add planks to spots connected to either a skyscraper or another 2x4 (i.e. you cannot "jump" over a gap), and you can only do so 4-directionally. Return the smallest number of planks needed to make the crossing. Case 1: Input: {[1,0,0,0],[0,0,0,0],…
The insertion sort was discussed and the implementation was demonstrated in the sorting lecture. In this assignment, you are asked to re-implement the insertion sort (InsertionSort.java),with additional requirements. Particularly, you need to show:1. For each iteration, how a number from a unsorted region is placed in the correctionposion in the sorted region;2. How to make the whole array be sorted based on the previous step, and count the totalnumber of shifts during the whole insertion sort process.2 Details of the ProgramTo complete the whole implementation, you should write at least the following importantmethods:2.1 Part1: insertLast/**A method to make an almost sorted array into fully sorted.@param arr: an array of integers, with all the numbers are sortedexcepted the last one@param size: the number of elements in an array*/public static void insertLast(int[] arr, int size){// your work}To make it concrete, let’s use the example shown in Figure 1. In this example, the…
Given an 8-element array: A = {x1, X2, X3, X4, X5, X6, 7, x8}, we would like to find its 3rd smallest element. It is known that x₁ and 8 are the two extreme elements: max and min, but we do not know which one is the max and which one is the min. It is also known that x4 and x5 are the two medians: left-median and right-median. What is the minimum number of comparisons you need to find the 3rd smallest element of the original array? Ans:
in C PROGRAMMING LANGUAGE AND COMMENT EVERY LINE SO I CAN UNDERSTAND EVERY STEP PLEASE, A C program can represent a real polynomial p(X) of degree n as an array of the real coefficients al, al, ..., an (an ‡ 0). p(X) = a0 + a1X + a2 X2 + . . .+ anXn Write a program that inputs a polynomial of maximum degree 8 and then evaluates the polynomial at various values of x. Include a function get_poly that fills the array of coefficients and sets the degree of the polynomial, and a function eval_poly that evaluates a polynomial at a given value of x. Use these function prototypes: void get_poly ( double coeffIl, int* degreep); double eval_poly( const double coeffIl, int degree, double x);
You're given an array of N integers, and a number K.The maximum K-product of the array is the maximum product of any K length subsequence of the array. For example, the maximum 2-product of the array [-5, 3, 4, -6] is 30 because the product of the subsequence [-5, -6] is 30 and it is impossible to achieve larger subsequence product.What is the maximum K-product you can achieve? Using JAVA programming output the max K-product.Input:14 25 -3 -4 6Output:30
LeetCode Given an array of strings words representing an English Dictionary, return the longest word in words that can be built one character at a time by other words in words. If there is more than one possible answer, return the longest word with the smallest lexicographical order. If there is no answer, return the empty string. Example 1: Input: words = ["w","wo","wor","worl","wo Output: "world" Explanation: The word "world" can be buil Example 2: Input: words = ["a", "banana", "app","appl" Output: "apple" Explanation: Both "apply" and "apple" can Constraints: • 1 <= words.length <= 1000 • 1 <= words [i]. length <= 30 words [1] consists of lowercase English letters.
You're given an array of N integers, and a number K. The maximum K-product of the array is the maximum product of any K length subsequence of the array. For example, the maximum 2-product of the array [-5, 3, 4, -6] is 30 because the product of the subsequence [-5, -6] is 30 and it is impossible to achieve larger subsequence product. What is the maximum K-product you can achieve? Using JAVA programming output the max K- product. Input: 1 42 5 -3 -4 6 Output: 30