Comment, data

You could build a simple state machine

State machine is over engineering for a single if. IMHO

State machine is over engineering for a single if. IMHO

(what if you want to handle space later(

(what if you want to handle space later(

What space?

" "

guys please don't complicate this problem

please I have just one day to finish it

The basic idea, read a character a time

and the whole project took me 4 days

" "

That's not part of the task. You just need to read #. That's it. Single if statement is enough

I have just to complet this function

(ok, but reading a whole line and then analyze it is not effectively way to do that...

(ok, but reading a whole line and then analyze it is not effectively way to do that...

There is no other way anyway. You need to read line to find where it ends.

I have just to complet this function

Read lines using fgets, check if it starts with # and ignore all results till new line.

There is no other way anyway. You need to read line to find where it ends.

Not quite, you can just read the first character to decide if it is needed to read whole line, and if the data is only 0 and 1, there no reason to store the line, you could read character one by one

By using getchar()

Only 4 cases '0', '1', ' ', '#'

Not quite, you can just read the first character to decide if it is needed to read whole line, and if the data is only 0 and 1, there no reason to store the line, you could read character one by one

You still read line. And you already have to have some buffer. So you'll save nothing.

Only 4 cases '0', '1', ' ', '#'

And two state: normal state for parse data, comment state to ignore whole comment line

And starting with normal state Assume the character is c If c == '#' then make a loop to ignore until '\n'

If c == '0' or '1', then store it

And two state: normal state for parse data, comment state to ignore whole comment line

There are only 2 states - starts with # or not. Everything else is irrelevant based on description

I think we are talking about the same thing, but expressing differently

And starting with normal state Assume the character is c If c == '#' then make a loop to ignore until '\n'

Since there are only two state, we may not need a variable to store it

Because '#' is a trivial case, just loop getchar until '\n'

So pesudo code is (I'm using a mobile phone right now) while (true) { switch (getchar()) { case '#': while (true) switch (getchar()) { case '\n': goto outer; case -1: goto eof; } outer: break; case '0': got0(); break; case '1': got1(); break; case ' ': case '\n': break; // maybe you need extend it to make it fit the requirements case EOF: goto eof; } }

So pesudo code is (I'm using a mobile phone right now) while (true) { switch (getchar()) { case '#': while (true) switch (getchar()) { case '\n': goto outer; case -1: goto eof; } outer: break; case '0': got0(); break; case '1': got1(); break; case ' ': case '\n': break; // maybe you need extend it to make it fit the requirements case EOF: goto eof; } }

It would be both easier and faster just to store the line

(btw the basic state machine model should be two level switch inside a loop while(cond) switch(state) switch (input)

It would be both easier and faster just to store the line

(getchar normally only copy a character from internal buffer, unless there no input right now (or buffer is full, but you need more

But if you want to store whole line, at first you need to know the line length

It may be larger than your local array(

Or it may cause incorrect behavior

Doing sort of std::getline should be fine. If you anyway care about performance you should use mmap or similar API

If the comment is 8192 characters, but you local buffer is 4096, and then you may either overwrite memory or incorrectly split the line, and make following content become "next line" but it isn't

Yes if the input file is large enough you might get some issues . It's not a case here

If the comment is 8192 characters, but you local buffer is 4096, and then you may either overwrite memory or incorrectly split the line, and make following content become "next line" but it isn't

You don't need to overwrite anything. You just read the line. Anyway - this is a homework. Not a production code in super computers.

It is a good idea to write correct code instead of "just work" code... The state machine may not fastest way, but it is common pattern for that kind of task... (As context free grammar parser

It is a good idea to write correct code instead of "just work" code... The state machine may not fastest way, but it is common pattern for that kind of task... (As context free grammar parser

It's correct without FSMs and parsers.

Unless you create dynamic array(or std:: string

Anyway, you still need read character one by one to extract data from your buffer

(or sscanf , that's worse

Anyway, you still need read character one by one to extract data from your buffer

You shouldn't read it one by one, you can read by N(usually multiple by page_size) bytes at once and use intrinsic commands to find '\n' character. Again it's not nessesary for this task.

So pesudo code is (I'm using a mobile phone right now) while (true) { switch (getchar()) { case '#': while (true) switch (getchar()) { case '\n': goto outer; case -1: goto eof; } outer: break; case '0': got0(); break; case '1': got1(); break; case ' ': case '\n': break; // maybe you need extend it to make it fit the requirements case EOF: goto eof; } }

Or if it not windows you may also try lex which is created for pattern matching with C

But yeah too hardcore. Checking given_string[0] == '#' was said before

It may be larger than your local array(

In that case it possible to use pointers not arrays and reallocate with them or simply getline(3)

/notes

/get reference-the-standard

/notes

/notes

Please I have a program in writing a c program to convert from decimal to a negative base How can I do that please ??

/get great

/get best

Please I have a program in writing a c program to convert from decimal to a negative base How can I do that please ??

You open your editor, write c code there and save it

/get awesomeness

You open your editor, write c code there and save it

I know how to write code , the issue is this particular code

I know how to write code , the issue is this particular code

So you already have written it?

So you already have written it?

No no

I mean like I don't know the algorithm to use

I have written a program that converts from decimal to other bases but is not working for negative base . I don't know why

Guys what is the best way to take data from such a file: https://pastebin.com/s4LxFNGE and transfer it to an array of structures?

I need the data between ':' and '\n'

Hii

Guys what is the best way to take data from such a file: https://pastebin.com/s4LxFNGE and transfer it to an array of structures?

Use std::regex if performance is not a concern

Use std::regex if performance is not a concern

i'm using C

Use std::regex if performance is not a concern

I think std::regex designed poorly

i'm using C

Then just search for ':' and substr

Guys what is the best way to take data from such a file: https://pastebin.com/s4LxFNGE and transfer it to an array of structures?

I think strtok should do https://www.cplusplus.com/reference/cstring/strtok/

Then just search for ':' and substr

I think sscanf is better here

But I'm not sure how to specify a variable length whitespace sequence in a format string

Node *delete(BinarySearchTree *bst , Node *current , int value) { if(current == NULL) return current; // first - find the node that contains the given value if (current->data < value) current->right = delete(bst,current->right,value); else if (current->data > value) current->left = delete(bst,current->left,value); else { // Now we've found the candidate node for deletion. //CASE 1: the node is a leaf if(isaLeaf(current)) { free(current); current = NULL; bst->size--; return current; } //CASE 2: the node have one child else if (current->right == NULL || current->left == NULL) { if(current->right == NULL) { // its means that the current node have left child Node *leftChild = current->left; free(current); bst->size--; return leftChild; } else { // its means that the current node have right child Node *rightChild = current->right; free(current); bst->size--; return rightChild; } } else { /*CASE 3: the node have two child , we need to search the node that contains the mimimum value of the rightsubtree */ Node *minChild = findMin(current->right); int minData = minChild->data; current->data = minData; current->right = delete(bst,current->right,minData); } } }

anyone know why its doesnt working?

its seems thats the recursion not going on the depth

I think strtok should do https://www.cplusplus.com/reference/cstring/strtok/

Can I use : and \n as delimiters?

Can I use : and \n as delimiters?

This will use delimiters any white space and new line . strtok(buffer, " \t\n")

Hy guys

can anyone help me out in a c ++ program 

Can anyone help me with a 3x3 matrix determinant code so would get the basics to solve 5x5

Can anyone help me with a 3x3 matrix determinant code so would get the basics to solve 5x5

Just follow definition.

Can anyone help me with a 3x3 matrix determinant code so would get the basics to solve 5x5

Do you know how to solve the issue for 2X2 matrix?

Do you know how to solve the issue for 2X2 matrix?

Yes

Do you know how to solve the issue for 2X2 matrix?

Yeah that simple but don't for 3x3