3. Selection Sort • The idea in a selection sort is that you locate the largest item out of a set of unsorted items, and move it into position at the end of the unsorted items. A sorted region grows one item at a time, while an unsorted region shrinks. • As done in Part 1, fill an array with random numbers. • Write a function that locates the largest element in the portion of the array beginning at the start of the array, up to a given index, and swaps the largest item with the item at the given index. • E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would be swapped. • Write a second function that calls the first function repeatedly, until the entire array is sorted. (Each time the first function is called, it will search one fewer element)

1. Display Function Implement a function to display the contents of the patient_list array.  Add code to call this function. Note that there are multiple places where this function needs to be called. Look for the  // TODO comments to find the correct locations. 2. Sorting the array by Age Implement the code to sort the contents of the patient_list array based on the value stored in the age field. To do this you will need to implement code that relies on the qsort function from the C Standard library A function that compares two patient elements, based on the value stored in the age field. A call to the qsort function, which includes the array to be sorted, the number of elements in the array, the size of each array element and the function used to compare the array elements. Add code to call the qsort function, using the age comparison function that you implemented.  This code should be placed just under the appropriate // TODO comment in main().  Sorting the array by…

Prompt: In Python language, write a function that applies the logistic sigmoid function to all elements of a NumPy array. Code:   import numpy as np import math import matplotlib.pyplot as plt import pandas as pd   def sigmoid(inputArray):               modifiedArray = np.zeros(len(inputArray))               #YOUR CODE HERE:               return(modifiedArray) def test(): inputs = np.arange(-100, 100, 0.5) outputs = sigmoid(inputs) plt.figure(1) plt.plot(inputs) plt.title('Input') plt.xlabel('Index') plt.ylabel('Value') plt.show() plt.figure(2) plt.plot(outputs,'Black') plt.title('Output') plt.xlabel('Index') plt.ylabel('Value') plt.show() test()

d) Print all the elements of the array that are greater than the previous element at smaller than the next element. The first and the last element should be excluded. int arr[] = {5,14,66,7,22,39,0,-12,23,91}

pyhton program  -Let A be an array with arbitrary length. What is the syntax for shifting A by 5 steps to the left (note the direction)?