Non Recursive calls store the local variables and stuff in stack
whereas in recursive calls the return addresses and the local variables for
each call are stored as stack frames with frame pointers and stack pointers.
On Thursday, September 1, 2011, teja bala wrote:
@priya
stack is a non
What does Blacklisting of drivers mean in Linux ?
Explain How you go about doing Blacklisting of Drivers ? Explain???
--
Regards
Rajeev N B http://www.opensourcemania.co.cc
*Winners Don't do Different things , they do things Differently*
--
You received this message because you are
Hi friends,
I have cleared the prior examination of Works application a japenese
company which is offering a package of $7pannum in tokyo ,ther's
high probability of getting selected in interview but as i hav read
tha cost of living in tokyo is too high plus japan is not that much
good for
salary is good...u can gobe with in technology with japannn..gud
luck
On Thu, Sep 1, 2011 at 12:37 PM, raj kumar megamonste...@gmail.com wrote:
Hi friends,
I have cleared the prior examination of Works application a japenese
company which is offering a package of $7pannum in
this s on geeks for geeks and the answer is 20
On 1 September 2011 00:11, htross htb...@gmail.com wrote:
u r not considering what if the first fork returns non zero and the
second for returns a zero value then
On Aug 31, 9:50 pm, rahul vatsa vatsa.ra...@gmail.com wrote:
int main()
{
if there is no bond then u must go... after all its money and technology for
which japan is good..
gud luck
On Thu, Sep 1, 2011 at 12:39 PM, rahul sharma rahul23111...@gmail.comwrote:
salary is good...u can gobe with in technology with japannn..gud
luck
On Thu, Sep 1, 2011 at 12:37
*Ln 2 :1st fork ret value +ve, (i.e parent), *
As is their before next fork, so nw 2nd fork will be calld,
if (ret = 0), won't go for next fork, (as its a true for ||) = so
1 pr from here
else if (ret ==0), will go for next fork. = so 2 prs from here
so, total 3 process in case
@dave:ur algo s nice:)
On Thu, Sep 1, 2011 at 9:49 AM, Dave dave_and_da...@juno.com wrote:
@Piyush: What does it do on
0 0 0
0 0 0
1 0 0
The output should be
1 0 0
1 0 0
1 1 1
Dave
On Aug 31, 8:24 pm, Piyush Grover piyush4u.iit...@gmail.com wrote:
What's wrong with this??
I think u should go and have experience in latest technologies, after all
Japan is known for new technologies. You will get many things to learn
there.
Sanju
:)
On Thu, Sep 1, 2011 at 12:39 AM, vaibhav shukla vaibhav200...@gmail.comwrote:
if there is no bond then u must go... after all its
@Raj
From my personal experience I can just say, being an Indian you will get
more respect in Japan rather in the US.
The problem you may face is the language and the food. If you are non veg,
well n good but if you are veg
you will have to cook it by yourself, there are indian curry restaurants
@Rahul : I have also mentioned that for the linker error.
You can place a definition int var; after main(), it will work.
Sanju
:)
On Wed, Aug 31, 2011 at 11:14 AM, rahul vatsa vatsa.ra...@gmail.com wrote:
@sanju, if u declare a variable with extern, at compile time its defn is
nt looked
Given two sorted positive integer arrays A(n) and B(n), we define a
set S = {(a,b) | a in A and b in B}. Obviously there are n2 elements
in S. The value of such a pair is defined as Val(a,b) = a + b. Now we
want to get the n pairs from S with largest values. need an O(n)
algorithm.
--
Regards,
@sid, ya in case of loop head2-next won't ever be NULL, bt this function
has to check if is there a loop. so u need to take care of condition wen
ther is no loop in the list. so 4 that this condition is required.
On Wed, Aug 31, 2011 at 11:17 PM, Siddhartha Banerjee
thefourrup...@gmail.com
ya thats rt.
On Thu, Sep 1, 2011 at 4:30 AM, Sanjay Rajpal srn...@gmail.com wrote:
@Rahul : I have also mentioned that for the linker error.
You can place a definition int var; after main(), it will work.
Sanju
:)
On Wed, Aug 31, 2011 at 11:14 AM, rahul vatsa vatsa.ra...@gmail.comwrote:
@ above, a third string is used, s3 which is strlen(s2)+ strlen(s1)
and thus in O(n) space
I guess qs calls out for O(1) space.
besides , if we have O(n) space , this question simply reduces to
finding the number of permutation of string s1+s2
I doubt we can do it in O(1) space, any idea guys
plus japan is not that much good for indians as US.' lmao, who told
you this ?
btw, which institute ?
On Thu, Sep 1, 2011 at 12:37 PM, raj kumar megamonste...@gmail.com wrote:
Hi friends,
I have cleared the prior examination of Works application a japenese
company which is offering a package
Guys american express is visiting Thapar University tommorw..
can any body help out with the test pattern, gd topics and interviews
questions.
--
Regards
Chunky Garg
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
@raj: how many students were selected from your college. they took written
xam today in my college.
On Thu, Sep 1, 2011 at 2:56 PM, shady sinv...@gmail.com wrote:
plus japan is not that much good for indians as US.' lmao, who told
you this ?
btw, which institute ?
On Thu, Sep 1, 2011 at
how many students were selected from your college? they took written xam
today in my college.
On Thu, Sep 1, 2011 at 2:56 PM, shady sinv...@gmail.com wrote:
plus japan is not that much good for indians as US.' lmao, who told
you this ?
btw, which institute ?
On Thu, Sep 1, 2011 at 12:37
ya got it thanx.
On Sep 1, 12:46 pm, rahul vatsa vatsa.ra...@gmail.com wrote:
*Ln 2 :1st fork ret value +ve, (i.e parent), *
As is their before next fork, so nw 2nd fork will be calld,
if (ret = 0), won't go for next fork, (as its a true for ||) = so
1 pr from here
else
@Raj
I did two months summer internship there in tokyo. I did internship in
scotland also and what I can say comparing the two is
I got royale treatment in Japan. People are more keen about indians and
Indian culture but in UK no one bother for
you and the same I heard from friends who worked in
This works for numbers with in 2^32 for 32-bit word length systems ..
int i=0;
for(int j=0;jn;j++)
{
if((i 1Array[j])0)
Array[j] is duplicate ..
else i |= (1Array[j]);
}
On Wed, Aug 31, 2011 at 7:15 PM, Gene gene.ress...@gmail.com wrote:
Sorting is fine but destroys the
@Mac: It gives us the first largest pair but need not all n pairs ..
ex:
A=1 1 3 4
B=1 2 3 4
pairs : (4,4),(4,3),(3,3),(2,4) .
On Thu, Sep 1, 2011 at 4:57 AM, MAC macatad...@gmail.com wrote:
since its sorted , cant we just take last (largest if assedning) elements
of each and return o(1)
how much is the package of american express can u plz tell me.
On Thu, Sep 1, 2011 at 2:31 AM, Chunky Garg g.chunkyg...@gmail.com wrote:
Guys american express is visiting Thapar University tommorw..
can any body help out with the test pattern, gd topics and interviews
questions.
--
Regards
@Aditya: If you are comfortable with working with fractions of area,
with area being a real number, then why not length, also being a real
number? The probability of a randomly selected point in the interval
[1, 100] satisfying a + 100/a 50 is exactly sqrt(2100)/99.
Dave
On Sep 1, 3:43 am,
bool interleave(string s1,string s3)
{
char *str1=(char*)s1.c_str();
char *str3=(char*)s3.c_str();
int pos=-1;
for(int i=0;istrlen(str1);i++)
{
if(posfindPosition(str1[i],str3))
{
pos=findPosition(str1[i],str3);
}
else {flag=1; break;}
}
if(flag==1)
print NOT
}
Do
which is better Subquery or Join in sql and why?
--
Regards
Ravi Maggon
Final Year, B.E. 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
subquery
On Thu, Sep 1, 2011 at 5:25 PM, ravi maggon maggonr...@gmail.com wrote:
which is better Subquery or Join in sql and why?
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
Algorithm
@priyanka good one
--
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,
for what reason?
On Thu, Sep 1, 2011 at 5:44 PM, sukran dhawan sukrandha...@gmail.comwrote:
subquery
On Thu, Sep 1, 2011 at 5:25 PM, ravi maggon maggonr...@gmail.com wrote:
which is better Subquery or Join in sql and why?
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
9 and 3
On Wed, Aug 31, 2011 at 9:22 PM, rohit raman.u...@gmail.com wrote:
output??
int main()
{
char *d = abc\0def\0;
printf(%d %d,sizeof(d),strlen(d));
getch();
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view
sizeof considers everything between double quotes + /0 character
strlen reads until first \0
On Thu, Sep 1, 2011 at 5:49 PM, sukran dhawan sukrandha...@gmail.comwrote:
9 and 3
On Wed, Aug 31, 2011 at 9:22 PM, rohit raman.u...@gmail.com wrote:
output??
int main()
{
char *d = abc\0def\0;
My guess is O(n) time bound can only be achieved with Dynamic
Programming here. Though, still to get proper sub problems to solve.
Calling out to Dynamic Programming experts to crack this one.
On Sep 1, 4:25 pm, bharatkumar bagana bagana.bharatku...@gmail.com
wrote:
@Mac: It gives us the first
I rally don't know how many are selecrted from my college bcoz i 've not
talked others i'll update the information soon
--
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
output is machine dependent.
On 9/1/11, sukran dhawan sukrandha...@gmail.com wrote:
sizeof considers everything between double quotes + /0 character
strlen reads until first \0
On Thu, Sep 1, 2011 at 5:49 PM, sukran dhawan sukrandha...@gmail.comwrote:
9 and 3
On Wed, Aug 31, 2011 at 9:22
Hi,
this is my first post in group. I dont know if this is right place for
it.
Consider a binomial heap which has n elements in it. Show that
insertion of additional m elements requires O(m + log n) time.
---Pratibha
--
You received this message because you are subscribed to the Google Groups
better select some other company
On Thu, Sep 1, 2011 at 12:37 PM, raj kumar megamonste...@gmail.com wrote:
Hi friends,
I have cleared the prior examination of Works application a japenese
company which is offering a package of $7pannum in tokyo ,ther's
high probability of getting
its oly 0 10 times since it is a static variable
On W ed, Aug 31, 2011 at 7:02 PM, teja bala pawanjalsa.t...@gmail.comwrote:
@rohit i think 0 will also be printed as the last while condition'll be
checked too
On Wed, Aug 31, 2011 at 6:59 PM, rohit raman.u...@gmail.com wrote:
123456789
Start with pair (A(i), B(j)) where i and j are both n.
Then the next largest pair will either be (A(i-1), B(n)) or (A(n),
B(j-1)). Whichever sum is larger, set i and j to those values. Repeat
as desired.
Don
On Sep 1, 3:45 am, Navneet Gupta navneetn...@gmail.com wrote:
Given two sorted positive
@ raj
which clg r u from? I would say btr to choose its branch in Singapore.
--
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/-/eUlkIYwpzTgJ.
To post to this
Can anybody explain logic ?
--
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
@Don: It is more complicated than that.
1st pair: (A(n),B(n)).
2nd pair: Either (A(n-1),B(n)) or (A(n),B(n-1)).
Suppose the 2nd pair is (A(n-1),B(n)).
3rd pair: Either (A(n-2),B(n)) or (A(n),B(n-1)).
Suppose the 3rd pair is (A(n),B(n-1)).
4th pair: Can be any of (A(n-2),B(n)), (A(n-1),B(n-1)),
let the total sum of the lengths of the two array is 'Len'
Median is Len/2 (if the two arrays are combined and sorted)
int count=0,i=0,j=0;
while(count(Len/2))
{
if(arr1[i]arr2[j])
i++;
else
j++;
count++;
}
if(arr1[i]arr2[j])
arr1[i]=median
else
arr2[j]=median
On Thu, Sep 1, 2011 at 9:01 PM,
Let's say you have two arrays: A[x] and B[y]. The median is the (x+y)/
2th value. If A[i] is the median, then B[(x+y)/2-i] = A[i] and B[(x
+y)/2-i+1] = A[i].
So you can use a binary search to find the point where that condition
occurs. Of course you want to search on the smaller array.
You'll need
I am from Delhi College of Engineering[now DTU] i don't think it's on us to
chose the location where we want to work , they will ask our preferences if
possible then only they will send us to singapore otherwise we will have to
go tokyo...
By the way is there anyone else who have cleared the exam
Given a Hexadecimal value as a string, give a C Code to convert it
into decimal value?
If 0xff then output should be 255.
--
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
akamai is visiting our campus on 03 sept can any1 tell sample question that
they might ask thanx in advance
--
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
it will be a little costly, but you can ask them to provide accommodation
and other utilities. Just be straightforward with them and tell all your
needs. Language is a bit of a problem, but that can be in other provinces of
India too. They are taking students across india so you wont be alone :)
in the same way as you do for binary to decimal, only base needs to be
changed
On Thu, Sep 1, 2011 at 10:04 PM, rShetty rajeevr...@gmail.com wrote:
Given a Hexadecimal value as a string, give a C Code to convert it
into decimal value?
If 0xff then output should be 255.
--
You received this
@Arpit : Could you please post the solution .
On Thursday, September 1, 2011, Arpit Sood wrote:
in the same way as you do for binary to decimal, only base needs to be
changed
On Thu, Sep 1, 2011 at 10:04 PM, rShetty
rajeevr...@gmail.comjavascript:_e({}, 'cvml', 'rajeevr...@gmail.com');
hi nyone having reviews anout samsung noida labplz tel
--
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
@Don : Thanks , are there any other methods
On Thursday, September 1, 2011, Don wrote:
int n;
char *string = 0xff; // Or whatever
sscanf(string, %x, n);
printf(%d\n, n);
On Sep 1, 11:34 am, rShetty rajeevr...@gmail.com javascript:; wrote:
Given a Hexadecimal value as a string, give
good company a great place to work some of my seniors are working there
--
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
@bharat I think pair of your example would be (4,4) , (4,3) ,(3,4),
(3,3)
correct me if am wrong..
On Thu, Sep 1, 2011 at 4:55 PM, bharatkumar bagana
bagana.bharatku...@gmail.com wrote:
@Mac: It gives us the first largest pair but need not all n pairs ..
ex:
A=1 1 3 4
B=1 2 3 4
pairs
how we find the median, if we don't have sufficient memory to merge them.
--
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/-/ePBMAl0aP4cJ.
To post to this
My O(ln n) binary search solution does not merge them.
In C code, it looks something like this:
// sizeA = sizeB
int A[sizeA];
int B[sizeB];
int min = 0;
int max = sizeA;
const int medianPos = (sizeA + sizeB) / 2;
while(max = min)
{
i = (min + max) / 2;
j = medianPos-i;
if (B[j] A[i]) min
Of course there are other methods, but why duplicate functionality
already provided by the language?
Don
On Sep 1, 11:34 am, rShetty rajeevr...@gmail.com wrote:
Given a Hexadecimal value as a string, give a C Code to convert it
into decimal value?
If 0xff then output should be 255.
--
You
My O(ln n) binary search solution does not merge them.
In C code, it looks something like this:
// Input arrays A and B, sizeA = sizeB
int A[sizeA];
int B[sizeB];
int min = 0;
int max = sizeA;
const int medianPos = (sizeA + sizeB) / 2;
while(max = min)
{
i = (min + max) / 2;
j = medianPos-i;
see this link
http://www.ihas1337code.com/2011/01/find-k-th-smallest-element-in-union-of.html
regards
Shyam
--
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
Hi Don,
Your algorithm is correct! I guess it can be simplified and made easy to
understand as follows:
Idea is to reduce the size of elements under consideration by half in each
iteration.
int aStart = 0, aEnd = sizeA;
int bStart = 0 , bEnd = sizeB;
while(aStart aEnd || bStart bEnd)
{
hey guys ,
I am trying to solve 8-queens problem using backtracking. Here is my algo.
Could someone please tell me what is wrong in this code??
bool queen(int p,int count , int position[][])
{
if(count == 8) return true;
for(int i=p,i8;i++)
for(int j=0;j8;j++)
if(marked(i,j) ==
Don's method is the best that I can think of.
On Thu, Sep 1, 2011 at 1:24 PM, Don dondod...@gmail.com wrote:
Of course there are other methods, but why duplicate functionality
already provided by the language?
Don
On Sep 1, 11:34 am, rShetty rajeevr...@gmail.com wrote:
Given a Hexadecimal
interesting because just the other day I wrote something to get all 92
solutions for 8x8 n queens problem in a little under 3 sec. I
also used to play chess seriously, and my coach once gave me this
exercise to find a few working configurations.
I would advise against blindly placing all
There are several issues.
There is nothing to back out a move if it fails. After the recursive
call to queen, you need an else which unmarks the board. That will
be hard to do, because there isn't a good way to remember what was
marked before.
I don't think you need to loop i from p to 7. The
I think that the complexity might even be log(sizeA) where A is the
smaller of the two arrays.
Imagine that you have sizeA = 3 and sizeB = 1,000,000,000.
You know that the median will either be in A, or it will be
B[500,000,000+/-1].
The binary search will start off by comparing A[1] with
On Fri, Sep 2, 2011 at 2:09 AM, Don dondod...@gmail.com wrote:
I think that the complexity might even be log(sizeA) where A is the
smaller of the two arrays.
Imagine that you have sizeA = 3 and sizeB = 1,000,000,000.
You know that the median will either be in A, or it will be
actually this makes me think about the question requirements a bit..
in math, arent sets supposed to have *unique* elements?
so if A= [ 1 2 3 4] , B= [ 1 2 3 4], then shouldnt
S = { (4,4) (4,3) (4,2) (4,1) (3,3) (3,2) (3,1) (2,2) (2,1)
(1,1) } ??
since A is equal to B, the size of S is
i kinda just ate my own words there ;P if a set has unique
elements, {4,4} isnt possible.. it would just be {4}
i'm not sure how to deal with ( ) instead of { }
On Sep 1, 5:12 pm, icy` vipe...@gmail.com wrote:
actually this makes me think about the question requirements a bit..
in math,
@Icy: You left off the pairs (3,4), (2,4), (2,3), (1,4), (1,3), and
(1,2). These are different than the pairs you listed, because they are
ordered: the first element is from set A and the second element is
from set B. This was masked because of your choice of A = B. But you
wouldn't have made that
The language does give it tyou in sscanf, but sscanf is a pretty big
function and in some environments, like small embedded ones, you don't
get the luxury of using a big block of code to do a small thing.
unsigned hex_to_unsigned(char *p)
{
unsigned val = 0;
while (*p != '\0') {
char c =
@Dave thanks for clarifying that (4,3) is different from (3,4)
But let's suppose, for example, n is 3
so A is of size n, and B is of size n, as required
e.g. A = [1 1 2] , B = [1 2 2]
S = { (1,1) (1,2) (1,2) (1,1) (1,2) (1,2) (2,1) (2,2) (2,2) }
but now you see there are repeated points
+1 Don
That's correct ..if we write as follows
while(i0)
{
--i
// rest ..
}
in this case we got all zeros
On Thu, Sep 1, 2011 at 12:47 PM, Shashwat Shukla
shashwatshukla.i...@gmail.com wrote:
People,
Use debugger and watch i. Answer is self explanatory.
On 1 September
given an unsorted array of +ve and -ve elements.find a subarray with sum= k
in O(n).
you can use some extra space
--
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
Okay, I guess this question will be more tough to tackle in complete
generality. in two sorted arrays, lets assume elements are in strictly
increasing order, hence the extra care of duplicates in either array
is gone. However, the same element can be present in both arrays.
For ex.
{1,2,3}
Given an unsorted Array A and any integer k where k = size of A
Print the maximum of each sub-array of size k of A.
eg: A = [ 3, 5, 1, 9, 0, 4, -1, 7 ] k = 4
Max: 9 9 9 9 7
--
Anup Ghatage
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
static variable is stored in data segement so it is alive thorugh the
proggo through let us c : data types
On Wed, Aug 31, 2011 at 10:16 PM, Swathi chukka.swa...@gmail.com wrote:
C standard doens't fine where it has to be stored.. go through this URL
make some databas in mysql;
now i want to implement it with class(OOP)
what streategy fallow
give some examle ;
--
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
I think stack !
On Fri, Sep 2, 2011 at 10:11 AM, Mani Bharathi manibharat...@gmail.comwrote:
Which data structure is analogous to the rice bag in your kitchen? why?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion
u mean, u want to write a class for mysql ?
a simple class u cn write which will ve member functions, OpenConnection,
fireTheQuery, Close ... depending on ur requirements ...
On Fri, Sep 2, 2011 at 12:52 AM, Maximilian Anthony
maximilian@gmail.com wrote:
make some databas in mysql;
Adding Two no without using any operator
#Iincludestdio.h
#includeconio.h
void main()
{
int a,b,i;
clrscr();
printf(enter 2 num:);
scanf(%d%d,a,b);
for(i=1;i=b-1;i++)
{
a=a+1;
}
printf(%d,a);
getch();
}
--
You received this message because you are subscribed to the Google Groups
Algorithm
@kb2029: how? why?
--
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/-/UKMOdCLe0sUJ.
To post to this group, send email to algogeeks@googlegroups.com.
To
See When we keep on pouring rice in a bag , then the rice which was poured
last will be the first to be taken out ,
| |
| * |
| * |
| * |
|_*_|
Assume stars represents rice !
|On Fri, Sep 2, 2011 at 11:08 AM, Mani Bharathi manibharat...@gmail.comwrote:
@kb2029:
stack coz of the lifo nature . i guess so
On Fri, Sep 2, 2011 at 11:08 AM, Mani Bharathi manibharat...@gmail.comwrote:
@kb2029: how? why?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
they basically ask questions on DBMS and networking.
In DBMS fst round mainly had SQL and 1 coding question related to ER DIAGRAM
.
in written round 3 question ws thr
1)ER diagram
2)stack n que
3)print this pattrn for n=3
X***X
*X*X*
**X***X**
***X*X***
X
***X*X***
**X***X**
static variables are allocated on heap . and global variables are sored on
data segment
On Fri, Sep 2, 2011 at 9:30 AM, rahul sharma rahul23111...@gmail.comwrote:
static variable is stored in data segement so it is alive thorugh the
proggo through let us c : data types
On Wed, Aug 31,
how did u get such o/p for k=4 ?? i dint get plz expalin
On Fri, Sep 2, 2011 at 9:04 AM, Anup Ghatage ghat...@gmail.com wrote:
Given an unsorted Array A and any integer k where k = size of A
Print the maximum of each sub-array of size k of A.
eg: A = [ 3, 5, 1, 9, 0, 4, -1, 7 ] k = 4
86 matches
Mail list logo
