GeeksforGeeks

Write Efficient Program to Implement the Radix Sort whats Complexity of algo , minimize it..why its not used so freq., t5ell the some scenarios where this sort play important roles e.g application

my bad luck i havn't read it so was not able to do it..just explained interviewer some algo..but he is not satisfied..can any1 will; try radix sort

Write an algorithm to print matrix multiplication of two square matrices such that they are represented in linked list. ie, if square matrices are of size 3*3 then the lists are a11->a12->a13->a21->...->a33 and b11->b12->b13->b21->...->b33. output should be a third linked list.

Given an unsorted array of numbers. Find if the array consists of consecutive numbers after sorting. Do this in linear time.

Example 1: If array has 5,2,3,1,4
after sorting we get 1,2,3,4,5 which represents consecutive numbers

Counter Example:
If the array has 34,23,52,12,3 after sorting we get 3,12,23,34,52 which are not consecutive

Given a group of strings, find a string by concatenating all the strings in any order which produces the lexicographically smallest string.

For e.g strings are acc bcc abb
So the string formed should be abbaccbcc

Given a NxN matrix. Suggest an efficient algorithm to find the determinant of the matrix.

Consider an increasingly sorted array 1,2,3..n . Let the number of comparisons needed be C1.
Now consider the decreasingly sorted array n,n-1,n-2,...n. Let the no of comparisons needed be C2.
Now how C1 and C2 are related?
a)C1<C2
b)C1>C2
c)C1=C2
d)can't say for arbitrary n.

you have 2-d array, with m length and n width.You are also given k,
( k<=n && k<=m ).
Now, select a square of size k, which has maximum sum.

We have a text file with 13 Million entries, all numbers in the range from 1.000.000 to 100.000.000. Each line has only one number. The file is unordered and we have about 1% duplicate entries. Remove the duplicates.

Why the legacy implementation of QuickSort is not stable? Would somebody please show with an example?