Define a sort function as below void sort(struct Employee * baseŋ, int n, int (*compareFunc)(struct Employee ** struct Employee **)) { qsort((void **)base,n,sizeof(void *),(int (*)(const void *,const void *))compareFunc); } Q1) What does the line in the provided sort function do? Describe each of the 4 arguments being passed to qsort. What do we need that big strange cast for the fourth argument?

Write a findSpelling Function -PHP Write a function findSpellings($word, $allWords) that takes a string and an array of dictionary words as parameters. The function should return an array of possible spellings for a misspelled $word. One way to approach this is to use the soundex() Words that have the same soundex are spelled similarly. Return an array of words from $allWords that match the soundex for $word.   I have most of the code. How do I append the $sound to the $mathcing array?

Presentation exercise 2 Write a function (including docstring) called multiply_term that takes a polynomial as inputs and a term. We can represent polynomials as a collection or power-coefficient pairs. Consider the following polynomial: p(x) = 2 - a4 – 3. x+ 5. We can represent it as the following collection of pairs: (4, 2), (1, -3), (0, 5). We can represent a term as a tuple where the first value indicated the exponent in the term, and the second its coefficient. For example, the term 5 - a* is represented by the tuple (4, 5). The function does not return anything, but after its execution the input dictionary will now represent the multiplication of the input polynomial by the specified term. For example: Page 2 >> p = {2 : 1, 1 : 2} # x^2 + 2x >>> t = (4, 5) # 5x^4 >>> multiply_term(p, t) >>> p == {6 : 5, 5 10} True You can assume that the function will receive as input a dictionary mapping integers to numbers. No need for you to implement any type of input validation.

In C++ Please summarize the differences between the following C++ sorting algorithms: Bubble Sort Merge Sort Selection Sort Insertion Sort Quick Sort Provide 2 - 3 sentences about each and your thoughts about working with the code for each. Which are easier to work with, which seem to move faster.    Include the following functions when compiling the code:   // Prints out an array of length 'n'   // Takes an array and its length as arguments   void print_array(int *array, int n){   for(int i = 0; i < n; i++){   cout << array[i] << '\t';   }   cout << endl;   cout << endl;   }       // Prints a dividing line   void print_dividing_line(){   for(int i = 0; i < 72; i++){   cout << '-';   }   cout << endl;   }       // Prints two elements being swapped and the remaining vector   // on separate lines   // Takes an array, index of swapping elements, and array size   // as arguments   void print_swap(int…

Part A - Determining the stride of an array-based function Consider the code in the clear_one function. void clear_one (int m[N] [N] [N]) { int i, j, k; for (i = 0; i < N; i++) for (j = 0; j < N; j++) for (k = 0; k < N; k++) m[i] [j] [k] = 0; } What type of reference pattern does the clear_one function have?