Re: [algogeeks] Re: kth smallest element

[Brijesh Upadhyay]

I guess this approach will work..

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/zeydVF1OqioJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Find the output

[Brijesh Upadhyay]

&array_name always has the size of whole array...so whenever u increase
this, it will get incremented by size of the whole array..as in this case ,
&a+1 points to next set of 5 numbers

On Fri, Sep 16, 2011 at 10:17 PM, Anup Ghatage  wrote:

> What does one mean by 'address of the whole array' ?
>
>
> On Fri, Sep 16, 2011 at 8:11 PM, mohan kumar wrote:
>
>> thank to explain to this problem...
>>
>>
>>
>> On Fri, Sep 16, 2011 at 1:40 PM, Yogesh Yadav  wrote:
>>
>>> a[]= {1,  2,  3,   4,5}
>>> a
>>>&a
>>>  a+1
>>>   &a+1
>>> &a is address of whole array...so &a+1 means next element after array
>>> completion.
>>>
>>> so ptr-1 will point to 5
>>>
>>> ...
>>>
>>>
>>> On Fri, Sep 16, 2011 at 1:25 PM, Anup Ghatage  wrote:
>>>
>>>> #include
>>>> int main()
>>>> {
>>>> int a[5]={1,2,3,4,5};
>>>> int *ptr=(&a + 1);
>>>> printf("%d %d\n",*(a+1),*(ptr-1));
>>>> return 0;
>>>> }
>>>>
>>>> Find the output!
>>>>
>>>> --
>>>> You received this message because you are subscribed to the Google
>>>> Groups "Algorithm Geeks" group.
>>>> To post to this group, send email to algogeeks@googlegroups.com.
>>>> To unsubscribe from this group, send email to
>>>> algogeeks+unsubscr...@googlegroups.com.
>>>> For more options, visit this group at
>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>
>>>
>>>  --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
>>
>> --
>>
>>- *MOHAN KUMAR*
>>
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Anup Ghatage
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Regards,
Brijesh Upadhyay
CSE , final year.
Thapar University

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: shortest swapping rows

[Brijesh Upadhyay]

IT is the question.. 
You are given an N x N matrix with 0 and 1 values. You can swap any two 
adjacent rows of the matrix.

Your goal is to have all the 1 values in the matrix below or on the main 
diagonal. That is, for each X where 1 ≤ X ≤ N, there must be no 1 values in 
row X 

that are to the right of column X.

Return the minimum number of row swaps you need to achieve the goal.

Input

The first line of input gives the number of cases, T. T test cases follow.
The first line of each test case has one integer, N. Each of the next N 
lines contains N characters. Each character is either 0 or 1.

Output

For each test case, output

Case #X: K
where X is the test case number, starting from 1, and K is the minimum 
number of row swaps needed to have all the 1 values in the matrix below or 
on the main 

diagonal.

You are guaranteed that there is a solution for each test case.

Limits

1 ≤ T ≤ 60

1 ≤ N ≤ 8

Input
  
 
3
2
10
11
3
001
100
010
4
1110
1100
1100
1000
Output 
Case #1: 0
Case #2: 2
Case #3: 4

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/aJHYyoc0z5sJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: shortest swapping rows

[Brijesh Upadhyay]

Make an array of size n, and fill it with index of last 1 of corresponding 
row in the matrix.. as if row 0 has  1101100 , than arr[0]=4 .
so we end up with an array containing last position of 1 in the respective 
row.. 
lets arr[4] is like 3,2,2,1... we have to make it 1,2,2,3.. so now apply 
following swap rules.
i) if by swapping two element , greater element is goin into greater 
index...do the swapping else move to next as in 2 ,3 ,2 ,1 : dont swap first 
2 and 3..
ii) or by swapping two element , lesser element is goin into lesser index 
...
and when you reach till the end , move back.. it may require many iteration, 
so use recursion.. *first forward traversing , and then backward* and front 
and end of the array will be decremented by 1 in each iteration..
Please let me know if it is wrong..! 


 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/Nbphh8aWnTkJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Amazon Interview Q

[Brijesh Upadhyay]

At the node from where the loop just started.. anyway we could not use that 
logic , coz it isnt circular linked list! 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/sr4w-kPmnEsJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Amazon Interview Q

[Brijesh Upadhyay]

But it is not circular doubly linked list.,..so u could not traverse in 
backward dirction from HEAD node..

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/0KIdBDCY49MJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Make My Trip *URGENT*

[Brijesh Upadhyay]

has anyone given MMT written test.??  please reply , what is the
pattern of the paper?

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Number theory

[Brijesh Upadhyay]

Actually it was one of the assignments given to me in lab.. here is the code

#include 

#include 

using namespace std;

int a[20][20][20]; // Global declration to make every cell's default value 
to zero

// 3D matrix to implement the algorithm

void combinations(int number) // function that accepts the number whose 
combination , you

{

int i, j, k, larg, m, n, flag;

for(i=1; i<=number; i++)

a[i][0][0]=i;

i=1;

while(i<=number)

{

// first row of each number is copied by that number

// external loop to access no. whose combination are inserted

flag=1;

j=1;

do{

//position of rows that is being modified

// inner loop that will run through i

for(k=0; a[j][k][0]!=0; k++) // innermost loop that will check for 
largest/last no.

{

for(larg=0; a[j][k][larg]!=0; larg++); //to check last value

larg--;

if(i-j>a[j][k][larg])

{

for(m=0; m<=larg; m++)

a[i][flag][m] = a[j][k][m];

a[i][flag][m] = i-j;

flag++;

}

// comapring last value with difference

// copy all existing values to current number

// insert difference between numbers

//increase the pointer to insert next combination

}

j++;

}while(j<=i);

i++;

}

k=number;

for(i=0; a[k][i][0]!=0; i++) {

cout<>number;

combinations(number);

getch();

return 0;

}

//input the number whose combination you want

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/CsTCslXuC88J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] find numbers whose difference is min

[Brijesh Upadhyay]

Algorithm to find the two numbers whose difference is minimum among the set 
of numbers. For example the sequence is 5, 13, 7, 0, 10, 20, 1, 15, 4, 19 
The algorithm should return min diff = 20-19 = 1. Constraint - Time 
Complexity O(N) 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/U8gTWUISJn8J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: C Output

[Brijesh Upadhyay]

I think i got it...  "STRING" always return address of S , which then get 
summed with 1 and 2.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/kFrZUxzFTxsJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] C Output

[Brijesh Upadhyay]

int main ()
{
  printf("%d",1+2+"5");
  getch();
  return 0;
} 


what should it return and how..??

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/2H3Gg6hLEQ0J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: String questions

[Brijesh Upadhyay]

Dynamic programming would surely help but i dont know the algo :| :P

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/MD3432cto60J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Microsoft Written Test Questions

[Brijesh Upadhyay]

Yeah...please share questions..it will be of a lot help!

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/cs4XYfgJrooJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Microsoft written!!!

[Brijesh Upadhyay]

thank u , i couldnot  have answered this :P

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/Gppo1P-Gr9oJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[Brijesh Upadhyay]

It could have a maximum of 81 leaves with the same '40' no of internal 
nodes so for any value between 28 to 81, it would have only 40 internal 
nodes

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/hb7mifIIe1kJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[Brijesh Upadhyay]

General approach would be , get the no of levels first by log 28 /log 3 , = 
4(use ceiling)...and now 3^0+3^1+3^2+3^3 = 40 will be no of internal nodes..

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/OyhD3tQ5uPgJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[Brijesh Upadhyay]

1 produces 3 nodes , which then 9 nodes,--> 27 nodes , and thses 27 
nodes finally produces <=81 leaves so sum of 27+9+3+1= 40 is the right 
answer... i guess

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/6EblaEKZozcJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[Brijesh Upadhyay]

80???  how can 80 internal nodes just produce only maximum of 81 leaves and 
that too in 3ary tree  
the answer is  1+3+9+27 = 40 internal nodes... think like this 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/7h9t9fFsVs0J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] pls help

[Brijesh Upadhyay]

I dont think 27 is the right answer,... it should be log 28 /log 3... i mean 
log 28 base 3 shuold be the no. of internal nodes !   and for any no of 
leaves , >27 &&  < 81, the answer would be same... 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/DN0DIvuwNLQJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Microsoft written!!!

[Brijesh Upadhyay]

 10
 4  5
   2  7  6 11
   1 39   8 12  13   14   15
let u have to fine leftmost right cousin of 8 . , move up , u get 10 as the 
ancestor , such that its left subtree contains 8 , unlike 7 ,4 (whose right 
subtree contains 8)!   now no of level u moved is 3 .. then traverse in 
the right subtree of 10 , and find left most node , by moving down 3 levels, 
and u get 12 as ur answer...

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/Lftrcml-FS0J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Microsoft written!!!

[Brijesh Upadhyay]

simple algo.. :
let we have to find leftmost right cousin of x!
>>  try to get an ancestor of the node x such that x lies in left subtree of 
that ancestor  , and count no of levels , say L,  u moved to get that 
ancestor..now start from that ancestor to get left most node IN THE RIGHT 
SUBTREE , by going down L levels... that might be ur answer... correct me , 
if i m wrong!

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/agOYaDD33H0J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Microsoft written!!!

[Brijesh Upadhyay]

simple algo.. :
let we have to find leftmost right cousin of x!
>>  try to get an ancestor of the node x such that x lies in left subtree of 
that ancestor  , and count no of levels , say L,  u moved to get that 
ancestor..now start from that ancestor to get left most node , by going down 
L levels... that might be ur answer... correct me , if i m wrong!

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/--VUgL7M18gJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Probability question.. help

[Brijesh Upadhyay]

No thers is not.. someone has asked me this., dont know anything else about 
the question  :|

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/mqMvDgb6TqUJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Probability question.. help

[Brijesh Upadhyay]

100 men & women dance with each other. What is the Probability that a
man cannot dance with more than two women?

--
Regards,
Brijesh Upadhyay
CSE
Thapar University

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Directi interview question

[Brijesh Upadhyay]

Yeah..right..!   u have to select continuous 10 petrol pumps , so just 
traverse through every set of 10 pumps with complexity of o(n). e.g. (1,10) 
(2,11) (3,12)(91 ,100)

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/MqV_rqnIbkMJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] sizeof operator C..

[Brijesh Upadhyay]

#include
#include

int main()
{
int a[2]={1,2};

cout

Re: [algogeeks] Amazon Question

[Brijesh Upadhyay]

Yeah.. 3rd answer is 1:1 , for reference 
http://discuss.fogcreek.com/techInterview/default.asp?cmd=show&ixPost=150

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/jd2b6mmXq0IJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] C easy doubt

[Brijesh Upadhyay]

Thank you , every 1 . got it...

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/3cPVG1k4kJ4J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] C easy doubt

[Brijesh Upadhyay]

int main()
{
int a[3][4]={1,2,3,4,5,6,7,8,9,10,11,12};
printf("%u %u %u",a, a+1,&a+1);
getch();
}

how &a+1 is valid..?? please explain

--
Regards,
Brijesh Upadhyay
CSE , final year.
Thapar University

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Probability Puzzle

[Brijesh Upadhyay]

I think 17/80 is right answer.. otherwise no use of mentioning *first five 
times* specifically in the question. ! though m not sure 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/1aMP_RgRaDYJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: amazon

[Brijesh Upadhyay , Computer Science , 4th year , Thapar Universoty]

How?? could u please explain..? why not quick sort?

On Aug 7, 10:27 pm, rajeev bharshetty  wrote:
> b:Shell sort
>
> On Sun, Aug 7, 2011 at 10:56 PM, Kamakshii Aggarwal
> wrote:
>
>
>
>
>
>
>
>
>
> > 1.what is the best sorting method for almost sorted array?
> > a.quicksort
> > c.hapsort
> > c.shell sort
> > d.bubble
>
> > --
> > Regards,
> > Kamakshi
> > kamakshi...@gmail.com
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> Regards
> Rajeev N B 
>
> "*Winners Don't do Different things , they do things Differently"*

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: amazon

[Brijesh Upadhyay , Computer Science , 4th year , Thapar Universoty]

Could u please explain how shell sort... why not quick sort??

On Aug 7, 10:42 pm, sourabh jakhar  wrote:
> shell sort is the correct answer
>
> On Sun, Aug 7, 2011 at 11:09 PM, ankit sambyal wrote:
>
> > bubble sort
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> SOURABH JAKHAR,(CSE)(Final year)
> ROOM NO 167 ,
> TILAK,HOSTEL
> 'MNNIT ALLAHABAD
>
> The Law of Win says, "Let's not do it your way or my way; let's do it the
> best way."

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.