In most contexts array object decays to a pointer to first element

I don't think it's a flaw iirc he did it to keep some sort of compatibility with B and BCPL

I don't think it's a flaw iirc he did it to keep some sort of compatibility with B and BCPL

And now Stroustrup trying to keep compatibility with C...

Endless loop

and I like it, because how else would you define the behavior without posing restrictions on calling conventions? I think it's not a bad solution.

Most of C++ design flaws are made just because it's tried to be compatible with C

and I like it, because how else would you define the behavior without posing restrictions on calling conventions? I think it's not a bad solution.

Probably for the times yes But how many legs where shooted when you pass wrong array size...

I don't think it's a flaw iirc he did it to keep some sort of compatibility with B and BCPL

src: https://www.bell-labs.com/usr/dmr/www/chist.html Section: Embryonic C

Wat

It's Undefined behavior

Ub

No

*pa gives you whole int, not a first byte

So you cannot write to pa + 1 Because it would be next int

*pa gives you whole int, not a first byte

but pa is pointer to char and aliasing is allowed through pointer to char

but pa is pointer to char and aliasing is allowed through pointer to char

Oh, I misread

Then probably it's ok

Useless, but ok

the only thing to watch out for is endianess

could be big or little endian, so your int depends on your arch

It is machine dependent behavior. You will get different result on big endian machine and little endian machine. This is well defined behavior.

It is machine dependent behavior. You will get different result on big endian machine and little endian machine. This is well defined behavior.

Well defined? Probably implementation defined

"like an array" is pretty vague, in the end both an array and int is a consecutive region of memory Data is not an array but one might argue "it behaves like it" void * Data = 0; char *P = (char*)Data; *P++ = 1; *P++ = 2;

Well defined? Probably implementation defined

That's fine, but not UB. If you have ever worked with htonX/ntohX, it is actually to make them can be transferred properly to/from any machine endianess.

you can read every byte of the memory pointed to by Data (the same way you did with int) but that doesn't make Data an array.

"consecutive region" Consider this example for little endian int a = 0x01234567; char *pa = (char *)&a; Will be: *pa++; // 0x67 *pa++; // 0x45 *pa++; // 0x23 *pa++; // 0x01

by that logic, everything would be an array of char

Yeah, I think memory works like a huge array and primitive data types are the number of bytes read in one cycle.

speaking in terms of the language, no. But that's more or less how it works under the hood

you cannot pass an array by value. in theory it would be possible, but how would you do it? Who keeps track of the size? Who allocates the space? Who frees the space?

Depends on the number of bytes. You can cast char[4] to (int32_t *). Take dereference, pass it as int32_t, then convert back to char[4] once it needs to be read by your function.

yes, because there is no good solution and back then it was designed with compatibility to B/BCPL in mind

you could always do something like this to "copy" the array. typedef struct { int Array[30]; } Dummy; void Bar(Dummy D) {} int main() { Dummy D; Bar(D); }

In 64 bit machine, you can only reads 8 bytes at a time. Except for SSE and AVX cases (which can read more than 64 bit at a time).

is there any way to make variables accessible to system() commands.

you really shouldnt do that, but you could build the string using something like sprintf

this outputs blank. i know this is expected but is there any way it can output 567?

you really shouldnt do that, but you could build the string using something like sprintf

please illustrate

please illustrate

int x = 1234; char buff[256]; sprintf(buff, "echo %d", x); system(buff);

never never never ever pass user-input to system bad thing

why is that?

never never never ever pass user-input to system bad thing

any specific reason for this?

int x = 1234; char buff[256]; sprintf(buff, "echo %d", x); system(buff);

oh also, consider using snprintf if you know the size of the buffer

any specific reason for this?

its very unsafe, and chances are, theres a better way to accomplish what youre trying to do

int x = 1234; char buff[256]; sprintf(buff, "echo %d", x); system(buff);

got it! thank you! you're awesome

This is not a assessment or test work. I tried this but there are some errors. If i give an input 5 it only showing Factorial 5 = 120 I need to get the Factorial from 1 to 5 How can i do that

This is not a assessment or test work. I tried this but there are some errors. If i give an input 5 it only showing Factorial 5 = 120 I need to get the Factorial from 1 to 5 How can i do that

A for loop inside another

That's fine, but not UB. If you have ever worked with htonX/ntohX, it is actually to make them can be transferred properly to/from any machine endianess.

Implementation defined != UB

/warn no one will write program for you

Is this AVL tree balanced??

Is this AVL tree balanced??

ya

ya

How to find if it's balanced or not?

How to find if it's balanced or not?

https://www.journaldev.com/43957/balanced-binary-tree-check#how-to-check-if-a-binary-tree-is-balanced 👀

https://www.journaldev.com/43957/balanced-binary-tree-check#how-to-check-if-a-binary-tree-is-balanced 👀

thankyou

thankyou

np

/get cppbookguide

Who can teach me c++?

Anybody on insta?

Cut m and n letters from end of string, then find number of turns to get back original string

guys can you help

Who can teach me c++?

possibly no one (sorry for that) Learning a new programming language usually needs studying and exercise for a long period of time

Cut m and n letters from end of string, then find number of turns to get back original string

It is not clear to me what you want would you please explain it by an example

ya

hey wait, i think its imbalanced, i inserted 8,now comparing the total heights from 8 to root and the right child of the root, the difference in height is 2, i.e 3-1 = 2

hey wait, i think its imbalanced, i inserted 8,now comparing the total heights from 8 to root and the right child of the root, the difference in height is 2, i.e 3-1 = 2

Yes, It is

If height > 1 or height < -1 -> imbalanced

And you should balance it

I was asked to insert another 4 in the tree , but there's already a 4 there , then where do I have to insert the 4 that was asked to insert ...

I was asked to insert another 4 in the tree , but there's already a 4 there , then where do I have to insert the 4 that was asked to insert ...

add a 4 under the 8, then use heapify or max heap to adjust it again

sorry got wrong, you got to add under the 4

cause is the nearest available space

sorry got wrong, you got to add under the 4

i dont understand, should 4 be a child node of 4??

it depends on how the heap is defined

https://stackoverflow.com/questions/22570126/can-max-min-heap-trees-contain-duplicate-values

Hello Who has an algorithm for generating match fixtures to share with me

Hello, Is this below correct? void f(std::vector<thing> && t); static_assert(passing the argument as reference): std::vector<thing> foo; void f(foo); static_assert(also this passing the argument as reference): void f(std::vector<thing>());

what can i use instead of a " "?

what can i use instead of a " "?

An array of ' '

char str[3] = {'H', 'I' /*null terminator inserted by compiler*/};

does not work brother