I was doing a problem and I am getting a bit confused on the worst cases for using merge sort on two arrays of lengths n and m. The question already says that they are sorted and I am assuming they are equal sizes respectively.

I have an array of objects already sorted lexicographicaly by name.

I did not get why shell sort is more efficient.
so here is a comparison of both algos according to what I have understood:

I was assigned homework. Now I have 13 mixed cards I want to arrange in straight order first then four of kinds > three of kinds > pairs > the remaining cards . Do you have any ideas? Give me an idea

I believe that the algorithm to find the k-th smallest element is in-place and my array also will be reshaped(k-th smallest element is at k index. left side is smaller and right side is bigger than k-th smallest). So this is my array shape after runing quick-select. why doesn’t it apply in pancake sort? When the k-th smallest element is found, the array is The array still has its original shape in each step?

I have a list of points that represent circles that have been detected in an image.