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!

Heapsort has heapified an array to: 99 79 94 43 76 81 21 and is about to start the second for loop. What is the array after the first iteration of the second for loop? Ex: 98, 36, 41

Rewrite the Binary search function in the textbook to use a generic type for the array elements. Test the function with arrays of int, double, and string values. *When using test arrays make sure elements are stored in ascending sorted order*

Implement Radix sort for strings. Both input and output are vectors of strings. You can assume all given strings have maximum 10 characters but you can not assume that they all have the same size. Here is the signature of the function you should be writing: vector RadixString(const vector & Input);

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.

Write a Python function def isSubArray(A,B) which takes two arrays and returns True if the first array is a (contiguous) subarray of the second array, otherwise it returns False. You may solve this problem using recursion or iteration or a mixture of recursion and iteration. For an array to be a subarray of another, it must occur entirely within the other one without other elements in between. For example: [31,7,25] is a subarray of [10,20,26,31,7,25,40,9] [26,31,25,40] is not a subarray of [10,20,26,31,7,25,40,9] A good way of solving this problem is to make use of an auxiliary function that takes two arrays and returns True if the contents of the first array occur at the front of the second array, otherwise it returns False. Then, A is a subarray of B if it occurs at the front of B, or at the front of B[1:], or at the front of B[2:], etc. Note you should not use A == B for arrays.

: You are given an array-like data structure Listy which lacks a sizemethod. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers,find the index at which an element x occurs. If x occurs multiple times, you may return any index.

Sorting is useful as the first step in many different tasks. The most common task is to make finding things easier, but there are other uses as well. In this case, it will make it easier to determine which pair or pairs of elements have the smallest absolute difference between them. Example [5, 2, 3, 4, 1] arr = Sorted, arr' = [1, 2, 3, 4, 5]. Several pairs have the minimum difference of 1: [(1,2), (2, 3), (3, 4), (4, 5)]. Return the array [1, 2, 2, 3, 3, 4, 4, 5]. Note As shown in the example, pairs may overlap. Given a list of unsorted integers, arr, find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all. Function Description Complete the closestNumbers function in the editor below. closestNumbers has the following parameter(s): int arr[n]: an array of integers Returns - int[]: an array of integers as described Input Format The first line contains a single integer n, the length of arr. The second line contains n…

Write pseudo code for bubble sort and dry run that pseudo code for an array with elements. 14, 33, 27, 35, 10