Design an Algorithm using pseudocode to eventually be implemented in Assembly that accomplishes the following:    Find the mean value of an n-element array within memory that contains numerical values. From the original array, sort all values that are lower than the mean, in sequential order from lowest to highest in a new array From the original array, sort all values that are greater than or equal to the mean, in sequential order from highest to lowest in another new array.Output all the original array and both of the new arrays to the screen.

DESIGN YOUR OWN SETTING Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, make sure to include the following: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times Maximum word count for…

A school uses the array to call an attendance register every morningWrite an algorithm using iteration to:• display the name of each student one at a time from studentnames• take as input whether that student is present or absent• display the total number of present students and number of absent students in asuitablemessage, after all student names have been displayed.

Use matlab

Please help Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. A subarray is a contiguous subsequence of the array.   Example 1: Input: nums = [2,3,-2,4] Output: 6 Explanation: [2,3] has the largest product 6. Example 2: Input: nums = [-2,0,-1] Output: 0 Explanation: The result cannot be 2, because [-2,-1] is not a subarray.   Constraints: 1 <= nums.length <= 2 * 104 -10 <= nums[i] <= 10 The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.   Example 1: Input: nums = [1,2,3,4,5,6,7], k = 3Output: [5,6,7,1,2,3,4]Explanation:rotate 1 steps to the right: [7,1,2,3,4,5,6]rotate 2 steps to the right: [6,7,1,2,3,4,5]rotate 3 steps to the right: [5,6,7,1,2,3,4]Example 2: Input: nums = [-1,-100,3,99], k = 2Output: [3,99,-1,-100]Explanation: rotate 1 steps to the right: [99,-1,-100,3]rotate 2 steps to the right: [3,99,-1,-100]  Constraints: 1 <= nums.length <= 105-231 <= nums[i] <= 231 - 10 <= k <= 105  Follow up: Try to come up with as many solutions as you can. There are at least three different ways to solve this problem.Could you do it in-place with O(1) extra space?

Convert the following pseudo code into assembly code. int array_list() = {10, 11, 13, 18, 21, 23, 24, 17, 45}; int array_size = sizeof array_list / sizeof sanple; int index = 0; / index for while loop int sun- 0; // accumulate the result for (current_size = array_size ; current_size > 8 ; current_size--){ while ( index < current_size){ if( array_list[index] is even ){ sum += array_list[index]; index + 1; Store the result in the variable – sum.

MARIE Code: Using the following MARIE Code attached, create a program that outputs the max and min of the array.

An input array consists of multiple integers. Write a sorting program to sort the content of the array in place. Sample: Input: {4,2,0,3,4,0,4,1,2,1,3} Output: [0011223344 4] Lab 8: Exercise 3 array before sorting: [4 2 e 3 4 e 4 1 2 1 3 ] array after sorting : [e e 1 1 2 2 3 3 4 4 4 ] Process exited after e.394 seconds with return value e Press any key to continue