Lorenzo Rossi
Ao
Lorenzo Rossi
C'è quarche italiano sgravato mpazzito ?
Dima
lol
labyrinth
Are you talking about endianness?
No, the interviewer expect other answer as I talked about endianness but i believe that what @VoidStar0x0 talked about is right, different os might have different memory alignment strategies for struct so it is better pad it with hard code.
labyrinth
I am just a fresh grad hopefully my re-interpretation on his answer is right 😅
Anonymous
Thank you rose!
labyrinth
for the COW in fork in linux, is the memory address copied in the unit of memory pages?
labyrinth
i think i found the answer, it is in the unit of page.
labyrinth
labyrinth
for a page tabled being copied, the new process shall update the page table which has correspondence to the physical memory addr right ? it did not elaborate
Sherlock
Please help me I am using binary search in c but the program is not running as expected, the function gives a segmentation fault without any reason
M__
show the code
😁😁
I need some c/c++ study material
😁😁
Anyone help
Roxifλsz 🇱🇹
Please help me I am using binary search in c but the program is not running as expected, the function gives a segmentation fault without any reason
It means that you have a memory management mistake in your code somewhere, you must show your code for anyone to be able to help you
Sherlock
wait
Sherlock
int binarysearch(int start,int end,int ar[],int n,int v){
int answer,mid=(start+end)/2;
printf("%d %d\n",start,end);
if(ar[mid]>v){
binarysearch(start, mid-1, ar, n, v);
}
else if (ar[mid]==v){
answer=mid;
printf("s%ds",answer);
}
else {
binarysearch(mid+1,end ,ar, n, v);
}
return answer;
}
// Complete the introTutorial function below.
int introTutorial(int V, int arr_count, int* arr) {
return binarysearch(0, arr_count-1, arr, arr_count, V);
}
Sherlock
int binarysearch(int start,int end,int ar[],int n,int v){
int answer,mid=(start+end)/2;
printf("%d %d\n",start,end);
if(ar[mid]>v){
binarysearch(start, mid-1, ar, n, v);
}
else if (ar[mid]==v){
answer=mid;
printf("s%ds",answer);
}
else {
binarysearch(mid+1,end ,ar, n, v);
}
return answer;
}
// Complete the introTutorial function below.
int introTutorial(int V, int arr_count, int* arr) {
return binarysearch(0, arr_count-1, arr, arr_count, V);
}
this is the code where the binary search function has this error somehow
😁😁
I want online study material and all stuff bro
Roxifλsz 🇱🇹
I want online study material and all stuff bro
Search for it online, i.e. just Google it
Asad
Anonymous
Google it bro try to find it online first than
Ask here ....
That is how you grow....
Anonymous
I bet you can find your answer on stackoverflow...
Anonymous
Why telegram video call can't go through VPN, is it safe?
Anonymous
Seems voice call connect directly too
Asad
I bet you can find your answer on stackoverflow...
I googled, and wrote what I had found from the internet... Please, if you know the answer, just tell me
Anonymous
I thought this is relevant to c++ development and network knowledge
Roxifλsz 🇱🇹
Why telegram video call can't go through VPN, is it safe?
Who knows ¯\_(ツ)_/¯
Roxifλsz 🇱🇹
I thought this is relevant to c++ development and network knowledge
Ehh, not really, it sounds more like a limitation of telegram specifically
Anonymous
Stop misusing the report feature
This is not mis use bro
I mean how that is related
C and C++
Roxifλsz 🇱🇹
Anonymous
Ehh, not really, it sounds more like a limitation of telegram specifically
Actually my main point is that if it connect directly , will it be vulnerable (if turn on the peer to peer only let it connect tg servers first)
Ибраги́м
Link them to ask in OT
Roxifλsz 🇱🇹
Actually my main point is that if it connect directly , will it be vulnerable (if turn on the peer to peer only let it connect tg servers first)
It's not "vulnerable", but anything that is P2P will leak your IP
Asad
What do you mean "not working", be more specific in your questions
I want the program to stop and what for user to press enter... However, fflush(stdin) does not seem to clear the buffer and getchar()is passing without prompting... Hope that I made it clear
Anonymous
It's not "vulnerable", but anything that is P2P will leak your IP
Is there's possibility that the respondent get the telegram calling ip with some methods ?
Mustafa
/get cppbookguide
Mustafa
/get ide
Dnyaneshwar
Deleted Account
this is the code where the binary search function has this error somehow
Ur code is right ....there is no error
Sherlock
I don't know it doesn't work
Deleted Account
Can you share the screenshot of the code written on pc
Sherlock
Wait be online
Sherlock
Sherlock
Sherlock
Deleted Account
Deleted Account
Ok lemme c that challenge
Sherlock
Sherlock
I changes the code a bit after I looked for the mid variable on google but it still gives the same output
Sherlock
Ok lemme c that challenge
It's just straight forward searching an element in a sorted array
Deleted Account
Look into discussion
Deleted Account
Ur code is working dude
Deleted Account
Show me the screenshot of error
Deleted Account
Because when I wrote it , it compiled
Sherlock
Sherlock
on hckrnk it compiled
Sherlock
but for any other compiler it doesn't
Sherlock
also if u submit it other cases will fail
Deleted Account
But you are using hackerrank platform na
Deleted Account
It passed all test cases
Sherlock
show the code
Sherlock
did you manually write the main function?
Deleted Account
And this code work well on other compilers too
Deleted Account
I jst pasted ur code
Sherlock
that's why
Sherlock
I haven't done that
Sherlock
Should I not use the boilerplate code It sometimes has errors I have faced them before too
Sherlock
It was a major concern for me please present your views
Deleted Account