2,201 views
0 0 votes

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
925
925 views
radha gogia asked Sep 9, 2015
925 views
char getstr(){ static char s[] = "GATE2016"; return s; } int main(){ printf("%s", getstr()); return 0; }Although I know I am returning an address using a character return...
0 0 votes
2 2 answers
772
772 views
Mak Indus asked Nov 10, 2018
772 views
Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]= i.(a) O (1) ...
1 1 vote
2 2 answers
4.7k
4.7k views
radha gogia asked Dec 20, 2015
4,708 views
I am unable to get the logic behind running bellman-ford for n-1 times , I have already gone through this link , but still couldn't get it clearly .http://cs.stackexchang...