#please__and__please

answer all the question and leave task 4 please answer all the question

use this matric 1920400431

C6 CO3 PO2 Task 1: Random number generation - Create a random number generator to create a list of unique integers (each number must appear only once). The code for this generator can be obtained from the internet. It must be able to generate at least 300 integers (no repeated numbers) by using your matric ID as a seed generator. Write the pseudocode of the function in your report. Task 2: Sorting Implementation - Implement merge sort, and quick sort to sort a list of integers. The code for these algorithms can be obtained from the internet (e.g., http://www.geeksforgeeks.org). However, detail remarks (comments) by using your own words are required to be provided in the code to show your understanding of the code. Each function must be accompanied by comments. Extra mark will be given if you implement additional sorting algorithms (e.g., shell sort ,insertion sort etc for this task). Task 3: Complexity Analysis - Theoretically discuss and compute the complexity of all sorting algorithms that you implemented. The discussion will describe your understanding of the algorithm. Put the complexity on a table as shown in Table 1 and Execution Time (in milliseconds) as shown in Table 2. Table 1: Complexity Analysis Algorithm Complexity Algorithm 1 O(log n) Algorithm 2 On) Table 2: Execution Time (in milliseconds) Algorithm 1 Algorithm 2 Algorithm 100 integers 200 integers 300 integers Task 4: Testing - Create a main function which is able to call the number generator and all algorithms. Apply the testing procedure: Sorting i) By using the function from Task 1, generate 100 unique integers. Output the list in a 100data.txt or 100data.csv file. Read the integers from the file in an array or linked list. Apply the algorithms to Task 3 to sort the list. Record the time taken by each of the algorithms as shown in Table 2. ii) 21 ASSIGNMENT 3 CAA EKT 2 2 4 Repeat the process with 200 and 300 unique integers. C6 CO3 PO2 Task 1: Random number generation - Create a random number generator to create a list of unique integers (each number must appear only once). The code for this generator can be obtained from the internet. It must be able to generate at least 300 integers (no repeated numbers) by using your matric ID as a seed generator. Write the pseudocode of the function in your report. Task 2: Sorting Implementation - Implement merge sort, and quick sort to sort a list of integers. The code for these algorithms can be obtained from the internet (e.g., http://www.geeksforgeeks.org). However, detail remarks (comments) by using your own words are required to be provided in the code to show your understanding of the code. Each function must be accompanied by comments. Extra mark will be given if you implement additional sorting algorithms (e.g., shell sort ,insertion sort etc for this task). Task 3: Complexity Analysis - Theoretically discuss and compute the complexity of all sorting algorithms that you implemented. The discussion will describe your understanding of the algorithm. Put the complexity on a table as shown in Table 1 and Execution Time (in milliseconds) as shown in Table 2. Table 1: Complexity Analysis Algorithm Complexity Algorithm 1 O(log n) Algorithm 2 On) Table 2: Execution Time (in milliseconds) Algorithm 1 Algorithm 2 Algorithm 100 integers 200 integers 300 integers Task 4: Testing - Create a main function which is able to call the number generator and all algorithms. Apply the testing procedure: Sorting i) By using the function from Task 1, generate 100 unique integers. Output the list in a 100data.txt or 100data.csv file. Read the integers from the file in an array or linked list. Apply the algorithms to Task 3 to sort the list. Record the time taken by each of the algorithms as shown in Table 2. ii) 21 ASSIGNMENT 3 CAA EKT 2 2 4 Repeat the process with 200 and 300 unique integers