Which sorting algorithm is Unstable?

Which sorting algorithm requires the minimum number of swaps?

Which of the following is not a variant of merge sort?

If the total complexity after micro analysis is 15n⁴ + 20n³ + 10n² + 5n + 400 log n + 10, what is the Big O complexity?

Given the input string "ABCDABCATRYCARCABCSRT" and the pattern string "CAT", find the first index of the pattern match using the quick search algorithm.

If all edges have the same weight in an undirected graph, which algorithm will find the shortest path between two nodes more efficiently?

What is the output of the following recursive function?

void my_function(int n)
{
   if(n == 0)
   return;
   printf("%d ",n);
   my_function(n-1);
}
int main()
{
   my_function(5);
   return 0;
}

In the implementation of Depth First Search (DFS) using a stack, what is the maximum distance between two nodes that can be present in the stack (considering each edge length as 1)?

Consider a dynamic hashing approach for 4-bit integer keys:

• (A) There is a main hash table of size 4.
• (B) The 2 least significant bits of a key is used to index into the main hash table.
• (C) Initially, the main hash table entries are empty.
• (D) Thereafter, when more keys are hashed into it, to resolve collisions, the set of all keys corresponding to a main hash table entry is organized as a binary tree that grows on demand.
• (E) First, the 3rd least significant bit is used to divide the keys into left and right subtrees.
• (F) To resolve more collisions, each node of the binary tree is further sub-divided into left and right subtrees based on the 4th least significant bit.
• (G) A split is done only if it is needed, i.e., only when there is a collision.

Consider the following state of the hash table.

Which of the following sequences of key insertions can cause the above state of the hash table (assume the keys are in decimal notation)?