Sort the array 10, -1, 20, -2, 15 using selection sort. Show the array boundaries | and swaps, as explained in text and in class.

Suppose an array has n elements. This _____ sorts to sort and array works as follows: Find the smallest element and place it in the first position. Then find the smallest of the remaining n-1 elements and place it in the second position. Repeat on n-2 elements, n-3 elements, ..., until the array is sorted.

Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass.The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position.Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…

In [ ]: We obtained an array with N = 10 values, scattered about mean of 25 (mm). Let's calculate the mean, standard deviation, standard deviation of the mean and 20-uncertainty SL of these numbers. In the following code, do these steps: • In the first cell, add a brief comment that explains what each statement does. Start each comment with a # sign. • In the second cell, delete the raise Not ImplementedError() code line and print the standard deviation and 20-uncertainty on the screen (follow the example for mean_L) mean_L = np.mean (L) print("Mean length: ", mean_L) stddev_L = np. std (L, ddof=1) stddev_mean_L = stddev_L/np.sqrt(N) uncertainty_L = 2*stddev_mean_L In [ ] V #YOUR CODE HERE raise NotImplementedError() #calculates the mean of L In the above code, the green expressions on the right hand side, such as np.mean, np. std and np.sqrt are functions built into the numpy package of Python. The names on the left hand side are variable names invented by me.

Write an algorithim DELETE(A,N,POS) to delete an element at POS. You can use the following array to implement your algorithim  {3,8,12,5,6} This can be pseudocode

Note:  Set a random seed of 100 for this assignment.  All arrays should contain random numbers between 0 and 1 (zero is inclusive).     Create a one-dimensional array of twenty float random numbers.   Assign the sum of these values to Q1.    Assign the max of these values to Q2.   Create a four by five array of random numbers.   Take the minimum values in each array and create an array of those values.  Assign it to Q3.   Assign the mean of all the array values to Q4.   Create an array with the following values: 2, 3, np.nan (this should represent a missing value), and 5.  Use a numpy function to find the sum of the values in this array.  Assign the sum to Q5 (you should expect a numerical value here).   Create two separate arrays each containing four random numbers.  Concatenate the two arrays and assign it to Q6.   Create a four by four array of random numbers and call it q7.  Concatenate this array with itself and assign it to Q7.   Create a two by four array of…

Write an array that matches the following requirement, and provide explanation of how you got your answer.--> Using a insertion sort on the array compared to using a selection sort requires FEWER comparisons of elements.

Array Challenge Have the function ArrayChallenge (arr) take the array of integers stored in arr, and determine if any three distinct numbers (excluding the first element) in the array can sum up to the first element in the array. For example: if arr is [8, 2, 1, 4, 10, 5, -1, -1] then there are actually three sets of triplets that sum to the number 8: [2, 1, 5], [4, 5, -1] and [10, -1, -1]. Your program should return the string true if 3 distinct elements sum to the first element, otherwise your program should return the string false. The input array will always contain at least 4 elements. Examples Input: [10, 2, 3, 1, 5, 3, 1, 4, -4, -3, -2] Output: true Input: [12, 3, 1, -5, -4, 7] Output: false