ort Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort and merge sort. Raw data is generated randomly.  For different problem size, output the number of comparisons and moves required by various sorting algorithms When the program is running, input the problemsize from the keyboard, the source data is randomly generated by the system, and then output the comparison times and movement times required by various sorting algorithms under this problem scale..   Do this in C language..the attached picture is just to show you how the program should be

Write a C++ program that fills an integer array of size 10 with numbers. Next, the program fills the second array with the contents of the first array in reverse. Next, the program prints elements of both arrays. In addition, the program finds the minimum element from the first array and the maximum element from the second array. Sample input / output: Enter element (1): 45 Enter element (2): 23 Enter element (3): 16 Enter element (4): 38 Enter element (5): 94 Enter element (6): 75 Enter element (7): 58 Enter element (8): 61 Enter element (9): 80 Enter element (10): 69 Elements of first array: 45 23 16 38 94 75 58 61 80 69 Elements of second array: 69 80 61 58 75 94 38 16 23 45 The minimum element in the first array is: 16 The maximum element in the second array is: 94

Perl I CpSc 390 Usin Perl Programm:  A list of names (names) is given : “Jo Peter Ann Fred Linda Joe”. Please do the following: print the names for the order number of the names find the name (CTRL-Z to exit from the input)  a second list  with  other group of names is also given: ”Mary, George, Nick”. An extension of the first list (names) so that to include the new names  is needed. Hint: try to keep space among the names make sorting reverse take the size of the list take  the  new list (from d) : peter linda joe jo fred an Nick Mary George and        delete all the other names except  : Joe, Peter, Mary, George. (in any order) . Give          the name for the list as: names1

Python EXERCISE 1. GENERATING AND PLOTTING A FUNCTION 1. Generate a list or ndarray of values from 0 to 4 with a spacing of 0.1 2. Calculate and plot the function x²-x² 635 025 020 015 630 005 0:00 00 la

Please help with this program. Need to create a program in python called dads-stack that doesn’t use adjacency list but instead uses an adjacency matrix. The code should prompt the user for input will post instructions and picture of algorithm. Based upon the REQUIREMENTS above, along with the IMPLEMENTATION DETAILS (Le, this sections, you MUST develop a FINAL algorithmic solution using paeudocode This includes both your logic in pseudocode) and the logic presented in the pseudocode indicated in Algorithm 2.3. 2 be sure to include your name, along with the Certificate of Authenticity, as comments at the very beginning of your Python code. Also, if you collaborated with others be sore to state their names as well 3. Your program should begin by prompting the user for the number of vertices in the graph G 4. Your program will represent the graph Gunung an adjacency matrix, which is a square matra with a row and a column for each vertex. Thus your program will need create a matrox…

A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary.   -----------------------------------------------------------------------------------   """ File: search.py Project 11.1 """ def sequentialSearch(target, lyst):     """Returns the position of the target item if found,     or -1 otherwise.     The lyst is assumed to be sorted in ascending order."""     position = 0     while position < len(lyst):         if target == lyst[position]:             return position         position += 1     return -1 def main():     """Tests with three lists."""     print(sequentialSearch(3, [0, 1, 2, 3, 4]))     print(sequentialSearch(3, [0, 1, 2]))     # Should stop at second position.     print(sequentialSearch(3, [0, 4, 5, 6])) if…