1. True False If f(n) = O(g(n)), then ƒ(n) + g(n) € ©(g(n)) False √ne 2 (logn) 2. True

Q: Write the following statement in symbolic form: If I will go to college then I will get a job, if…

A: Let  "go to college"  is P  "not go  to college" is ~p " get a job"  is q "not get a job" is ~q…

Q: Instructions: 1. Submission deadline6/1/20232. If you copy from others zero will be given. 3.…

A: The Answers of the above questions are below:

Counting sort

The counting sort algorithm sorts an array’s contents by counting the repetition of each element that occurs in the array. A counting sort algorithm is a stable algorithm that works the best when the range of elements in the array is small, say for example from 0 to 9. The count which is the number of repetitions of an element in the array is mapped to an index of an auxiliary array, which is then saved in an auxiliary array. The counting sort algorithm has a stable time complexity of the order of O(size of array + size of auxiliary array). Let’s discuss the algorithm in detail as follows.