Assume that a file contains an integer sequence:             18, 17, 1, 2, 3, 4, 16, 15, 14, 13, 5, 6, 7, 8, 9, 10, 12, 11     and the buffer (in main memory) is of size 5 blocks with each being able to hold 2 integers.     Sort this file using the external sorting algorithm. Trace the computation process.

3. Given the following list: 9 4 2 6 7 5 3 8 Identify the state of the list while being sorted using the selection sort algorithm.

1. The sequential search algorithm will always find the first occurrence ofan item in a data set. Create a new sequential search method that takes asecond integer argument indicating which occurrence of an item you wantto search for.

Octave/Matlab: How do I write a script that reads in the file and then collects the values from the columns into a vector like: file1.txt 10 11 12 13 14 15 So the output should look like: A = [10,13] B = [11,14] C = [12,15]

Tracing Exercise: What will be displayed exactly after the following .m file is executed? n = [1 -88 300 27 -10 17]; p = n(1); for j = 3:length(n), p = p + n(j) end k = 0; tt = 10; while k < 15 k = k + 3 tt = tt + k end disp (k) disp (tt)

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…

Python, input file has the following structure (number, then animal each on a line): 4Cows5Camels1Peacock3Whales4Lions2Scorpions Two output files are required:first output_file: sort by (dictionary) key but those sharing the same key should be listed on the same line with a ";" separated 1: Peacock2: Scorpions3: Whales4: Cows; lions ------------------------------> separated by ';' because they share the same key 45: Camels second output_file:Only values are sorted as follows and written to file: CamelsCowsLions PeacockScorpionsWhales   Thank you