Java Script Create a function that takes an array of integers as an argument and returns the same array in ascending order. Using sort () would be easy, but for this challenge YOU have to sort the array creating your own algorithm. Examples sortArray ([2, -5, 1, 4, 7, 8]) sortArray ([23, 15, 34, 17, -28])-> [-28, 15, 17, 23, 34] [-5, 1, 2, 4, 7, 8]

Java Script Create a function that takes an array of integers as an argument and returns the same array in ascending order. Using sort () would be easy, but for this challenge YOU have to sort the array creating your own algorithm. Examples sortArray ([2, -5, 1, 4, 7, 8]) sortArray ([23, 15, 34, 17, -28])-> [-28, 15, 17, 23, 34] [-5, 1, 2, 4, 7, 8]

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

JAVA Programming Write a function that returns true if you can partition an array into one element and the rest, such that this element is equal to the product of all other elements excluding itself. Examples canPartition ([2, 8, 4, 1]) → true // 8 = 2 x 4 x 1 canPartition ([-1, -10, 1, -2, 20]) → false canPartition ([-1, -20, 5, -1, -2, 2]) true
An array is special if every even index contains an even number and every odd index contains an odd number. Create a function that returns true if an array is special, and false otherwise. Examples isSpecialArray([2, 7, 4, 9, 6, 1, 6, 3]) → true // Even indices: [2, 4, 6, 6]; Odd indices: [7, 9, 1, 3] isSpecialArray([2, 7, 9, 1, 6, 1, 6, 3]) → false // Index 2 has an odd number 9. isSpecialArray ([2, 7, 8, 8, 6, 1, 6, 3]) → false // Index 3 has an even number 8.
JAVA Problem Create a function that determines whether elements in an array can be re-arranged to form a consecutive list of numbers where each number appears exactly once. Examples cons([5, 1, 4, 3, 2]) → true // Can be re-arranged to form [1, 2, 3, 4, 5] cons([5, 1, 4, 3, 2, 8]) → false cons([5, 6, 7, 8, 9, 9]) → false //9 appears twice
C programming language
Java Program Your program should use 2D arrays to implement simple matrix operations. Your program should do the following: • Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order • Print M1 to the console; make sure you format as a matirx • Repeat the previous steps for a second matrix M2 • Create a matrix M3 that is the transpose of M1 and print it to the console • Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message. • Extra credit: Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements: • Use a helper method for reading a positive integer using an input validation loop. • Use a helper method for printing a matrix. Your helper methods should be private and…
python
Java program
Write a function that partitions the array into two subarrays: one with all even integers, and the other with all odd integers. Return your result in the following format: [[evens], [odds]] Example: evenoddpartition ([2, 4, 8, 9]) → [[2, 4, 8], [9]] WRITE IN PYTHON PLEASE
Using C++ Implement the ordered version of removeElement in the window below. Your function should validate inputs and remove the element in the given position by moving all of the other elements down. // removeElement preserves the order of the remaining elements in the array.// @param: char array that is ordered in some way.// @param: int numElems is the number of elements// @param: int position of the element being removed// @returns true if the element is removed, false otherwise.// be careful to use reference parameters where necessary!
function Sum(A,left,right) if left > right: return 0else if left = right: return A[left] mid = floor(N/2) lsum = Sum(A,left,mid) rsum = Sum(A,mid+1,right) return lsum + rsum function CreateB(A,N)B = new Array of length 1 B[0] = Sum(A,0,N-1) return B Building on the above, in a new scenario, given an array A of non-negative integers of length N, additionally a second array B is created; each element B[j] stores the value A[2*j]+A[2*j+1]. This works straightforwardly if N is even. If N is odd then the final element of B just stores A[N-1] as we can see in the figure below: (added in image) The second array B is now introducing redundancy, which allows us to detect if there has been a hardware failure: in our setup, such a failure will mean the values in the arrays are altered unintentionally. The hope is that if there is an error in A which changes the integer values then the sums in B are no longer correct and the algorithm says there has been an error; if there were an error in B…
Write a C program to find the position of a target value within an array using Linear search In computer science, a Linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched. Use array as following: {0, 10, 40, 20, 30, 50, 90, 75, 82, 92, 155, 133, 145, 163, 200, 180} 1) find 30 2) find 100 3) find 92
please code in python def isEverywhere(nums, val): #complete the function We'll say thatt a value is "everywhere" in an array if for every pair of adjacent elements in the array, at least one of the pair is that value. Return true if the given value is everywhere in the array. Example: isEverywhere([1,2,1,3],1) -> trueisEverywhere([1,2,1,3],2) -> falseisEverywhere([1,2,1,3,4],1) -> false