Two of your co-workers (Sam and Kris) both wrote a different unique sorting algorithm. Initial tests (with 50 data elements) show that Kris’ program ran approximately 5x faster (Sam’s took 5x as long to complete).  As the chief engineer, you need to figure out which one to use – Should Sam’s program be dropped in favor of Kris’? Is Kris’ better? Why or why not?  What other tests would you run (what other criteria would you be looking for)?  Make sure you explain your answer.

Using Oz Programming, how would one create a program for finding the nth Fibonacci number in the sequence? I know it has matrix, though I can't seem to get that working in Oz. The main goal was finding an implementation with an O (log n) time complexity. Thanks!

Merge sort is an efficient sorting algorithm with a time complexity of O(n log n). This means that as the number of elements (chocolates or students) increases significantly, the efficiency of merge sort remains relatively stable compared to other sorting algorithms. Merge sort achieves this efficiency by recursively dividing the input array into smaller sub-arrays, sorting them individually, and then merging them back together. The efficiency of merge sort is primarily determined by its time complexity, which is , where n is the number of elements in the array. This time complexity indicates that the time taken by merge sort grows logarithmically with the size of the input array. Therefore, even as the number of chocolates or students increases significantly, merge sort maintains its relatively efficient performance. Regarding the distribution of a given set of x to y using iterative and recursive functions, the complexity analysis depends on the specific implementation of each…

The interchange implementation was supposed to be better than the transpose implementation as it implements the same algorithm without the need of copying the 640,000 elements. However, it is not. How do you explain this inconsistency?

You are building a simulation and need to generate X ~ norm(506.5, 83.5725). Given the following U ~ unif[0,1], calculate the corresponding values of X: U = {0.8864,0.6067,0.366} Note: the following should help if you are using R. U: 0.8864, 0.6067, 0.366   Please enter your answers to four decimal places: U1= 0.8864 => X1 =       U2=0.6067 => X2 = U3=0.366 => X3=

Answer the given question with a proper explanation and step-by-step solution. java

Consider sorting a list of items that are in reverse sorted order. If you were forced to pick between the three iterative sorting algorithms (bubble sort, selection sort, or insertion sort) to work through this set and place it into normal (ascending) sorted order, which would you pick and why?

Data structure: Using Java,

Please help me solve the problem with step by step solution.