you become a system administrator for a huge company, one midnight you are sleeping but you get a call from your company , shit just went down in the chaotic way possible. You need to ssh into your server quickly and fix a few configurations etc internet is down, its raining. You have to drive over to your mainframe or whatever they are called and work on the machine directly. There's no gui, no fancy ide, no fancy editors.

so vim is a and the must.....

Basically suppose you have a sorted array, say for example, 16 21 32 43 75 96. Now what you want to do is that check if 75 is in the array or not. Of course one thing you can do is that you traverse through the array from beginning to end and stop only if you find 75, and if you travel the full array without finding 75, then it is not present. This approach is called linear search. But a better approach would be to narrow down your search space as you go. First of all, you go to the middle element (which is 32 or 43 in this case, depending on your implementation) and see if it is less than or equal to 75. Since it is less, now you discard the first half and only look at the second half of the array. In the second step you have 43 75 96 to work with, and you go to the middle and you find 75 here, so you stop. This is the binary search approach and as you can see, it takes only 2 steps in comparison to the 5 steps of checking in linear search. @bitkrypton0

int position = -1; for (int i = 0; i < 25; i++) { if(prime[i] == x) { position = i; break; } }

#include<iostream> using namespace std; int main () { int primenumber[25]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97}; int guess; int totaltries=0; int guesslimit=2; bool remainingguess = true; while (guess != primenumber[] && remainingguess) { if (totaltries<=guesslimit) { cout<<"Guess the number between 1-100:"<<endl; cin>>guess; totaltries++; } else { remainingguess = false; } } if (!remainingguess) { cout<<"You lose :("; } else { cout<<"You Win :)"<<endl<<"Tries = "<<totaltries; } }

position is an integer that indicates the index of the array in which the value you're looking for is present. It is -1 if the value is not present in the array.

#include<iostream> using namespace std; int main () { int primenumber[25]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97}; int guess; int totaltries=0; int guesslimit=2; bool remainingguess = true; int position=0; int i = -1; for (i=0; i<25; i++) { if (primenumber[i]==guess) { position = i; break; } } while (guess != primenumber[position] && remainingguess) { if (totaltries<=guesslimit) { cout<<"Guess the number between 1-100:"<<endl; cin>>guess; totaltries++; } else { remainingguess = false; } } if (!remainingguess) { cout<<"You lose :("; } else { cout<<"You Win :)"<<endl<<"Tries = "<<totaltries; } }

Why i = -1?

Hi Can anyone help me im writing code for asking about the name and printing the name

Yes, other than that it seems to be fine

C or C++?

C

I'm afraid I can't help you much with C

Replace int position = 0 with int position = 1 and replace int i = -1 with int i

Replace int position = 0 with int position = 1 and replace int i = -1 with int i

#include<iostream> using namespace std; int main () { int primenumber[25]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97}; int guess; int totaltries=0; int guesslimit=2; bool remainingguess = true; int i; int position = -1; for (i=0; i<25; i++) { if (primenumber[i]==guess) { position = i; break; } while (guess != primenumber[position] && remainingguess) { if (totaltries<=guesslimit) { cout<<"Guess the number between 1-100:"<<endl; cin>>guess; totaltries++; } else { remainingguess = false; } } if (!remainingguess) { cout<<"You lose :("; } else { cout<<"You Win :)"<<endl<<"Tries = "<<totaltries; } }}

Seems so, yes

Of course @bitkrypton0 you have to search after the input is taken, right

But when i run it prints "you win" 25 times :(

this if : is never satisfied primenumber[i] cant be equal to un unset guess thus position is allways equal to -1 which is not a valid index for the array ,

Bro let me know if we can do it without for loop as my teacher haven't taught for loop so i can't use it

How to allocate dynamic memory in pointers and vice versa?

Did you try searching before asking https://www.ecosia.org/search?q=How+to+allocate+dynamic+memory

What features does D offer that C++ does not and how is it more modern?

- Pattern matching - Actual pure functions (C++ consts are NOT pure as in they allow other states to be modified) - A working package manager - Actual types (C++ types lie to the programmer. Nobody should ever be allowed to do something as creepy as dynamic_cast<> or void*) - Attributes (although C++ does support metaprogramming, it is not context-aware) - Contracts, and thus Dependent Types (C++ does support constexpr and other related cool stuff, but lacks of dependent types)

- Pattern matching - Actual pure functions (C++ consts are NOT pure as in they allow other states to be modified) - A working package manager - Actual types (C++ types lie to the programmer. Nobody should ever be allowed to do something as creepy as dynamic_cast<> or void*) - Attributes (although C++ does support metaprogramming, it is not context-aware) - Contracts, and thus Dependent Types (C++ does support constexpr and other related cool stuff, but lacks of dependent types)

https://twitter.com/mcypark/status/1352022455846506497

what about the other points?

Tomorrow I have a exam please help me out

Those are points I do not care too much about. For native development I will refrain from using a GC collected language. I remember the Discord blog post where they ditched Go in favor of Rust and measured latencies in us instead of ms. Deterministic object destruction is something a lot of languages lack, but it is really useful. in D it is not even guaranteed that GC calls the destructor for all objects. C++ supports Attributes as well, has way more powerful templates, compile time programming with constexpr and a strongly typed system. What's your issue with dynamic_cast ? I makes sure the cast succeeds. void* is useful when you deal with hardware and I don't think a package manager and testing framework should be part of the language. I'd like to see updates to my package manager/testing framework without waiting for a new language revision to be released.

#include<stdio.h> #include<stdlib.h> #include<string.h> typedef struct { int *piData; char *pcName; } Info; int main() { Info MyInfo; MyInfo.piData = malloc(sizeof(int)); if((MyInfo.piData) == NULL) { printf("FAILED TO ALLOCATE MEMORY\n"); return 0; } *MyInfo.piData; scanf("%d",&*MyInfo.piData); printf("MyInfo.piData = %d\n",*MyInfo.piData); MyInfo.pcName = malloc(sizeof(char) * (*MyInfo.piData )); if((MyInfo.pcName) == NULL) { printf("FAILED TO ALLOCATE MEMORY\n"); return 0; } strncpy(MyInfo.pcName,"programmer",(*MyInfo.piData)); printf("MyInfo.pcName = %s\n",MyInfo.pcName); return 0; }

Why everytime i get a different output when i input any even number?

It seems to work just fine... Have you tried lengths [0, 12]? There is a memory leak but the program exits before an issue.

whats up folks

#include<stdio.h> #include<stdlib.h> #include<string.h> typedef struct { int *piData; char *pcName; } Info; int main() { Info MyInfo; MyInfo.piData = malloc(sizeof(int)); if((MyInfo.piData) == NULL) { printf("FAILED TO ALLOCATE MEMORY\n"); return 0; } *MyInfo.piData; scanf("%d",&*MyInfo.piData); printf("MyInfo.piData = %d\n",*MyInfo.piData); MyInfo.pcName = malloc(sizeof(char) * (*MyInfo.piData )); if((MyInfo.pcName) == NULL) { printf("FAILED TO ALLOCATE MEMORY\n"); return 0; } strncpy(MyInfo.pcName,"programmer",(*MyInfo.piData)); printf("MyInfo.pcName = %s\n",MyInfo.pcName); return 0; }

I changed it to work in VS: #define _CRT_SECURE_NO_WARNINGS #include<stdio.h> #include<stdlib.h> #include<string.h> typedef struct { int* piData; char* pcName; } Info; int main() { Info MyInfo; MyInfo.piData = (int*)malloc(sizeof(int)); if ((MyInfo.piData) == NULL) { printf("FAILED TO ALLOCATE MEMORY\n"); return 0; } *MyInfo.piData; scanf("%d", MyInfo.piData); printf("MyInfo.piData = %d\n", *MyInfo.piData); MyInfo.pcName = (char*)malloc(sizeof(char) * (*MyInfo.piData + 1)); if ((MyInfo.pcName) == NULL) { printf("FAILED TO ALLOCATE MEMORY\n"); return 0; } strncpy(MyInfo.pcName, "programmer", (*MyInfo.piData)); MyInfo.pcName[*MyInfo.piData] = 0; printf("MyInfo.pcName = %s\n", MyInfo.pcName); system("Pause"); }

Nice! Don't forget to free() the leftovers in the 2nd malloc check.