I like vs Code

does not have a compiler

does not have a compiler

did you use and configure the C++ Extension?

I can't imagine not using Vim + GCC/G++ on a Linux system as a dev workflow

I can't imagine not using Vim + GCC/G++ on a Linux system as a dev workflow

I have a question On C++ and linux Should I ask in OT?

how is using gcc/g++ on Windows any different?

I keep seeing people in programming groups having loads of problems because they're trying to do stuff on Windows

its passage is here

Take a sheet of paper and run the function with pen and paper

I haven't tried to do it but I presume it's difficult to setup

I did that, if you know how it works, I ask a question.

Because --1 == +1

exclusive IDE names for C / C ++ that are free?

How many header files in c++???

One thing that you probably haven't realized that the remainders (n%10) need to be printed in the opposite order for the number to be printed correctly. So, in the function printd: 1. Print a minus sign if the number is negative and then, having done that, turn the number positive (since negative of negative is positive). 2. If the number if greater than 10 (if (n/10)), call printd again with n/10 so that the remainder that gets printed (in the next step) gets printed in reverse order. 3. Find the last digit of n by doing n%10, find its ASCII representation by adding it to '0' (the character '0', not the number 0) and then printing it. Take an example number and try to work with it.

http://eel.is/c++draft/headerindex

http://eel.is/c++draft/headerindex

Hi. Recursion is really hard in C, one should be a genius to use it. Have you ever written one by yourself in real program?

Which One i should leaen after <iostream>???

Sure I have, depending on the context I prefer iterative implementations though (can be hard to prevent stack overflows in recursion)

Iterative implementation is diifrent from recursion?

In recursion, if we call a function for two or three consecutive times, are they all called at the same time, or one at a time?( like the ones for qsort in the picture below).

"recursion" has no effect on a function invocation. You might want to read this article https://en.wikipedia.org/wiki/Recursion_(computer_science)

Do you know how quicksort works?

yes

We have two parts, left of pivot and right of it.) the first qsort (v, left, last) deals with the left part. And the second one qsort(v, left, last - 1) deals with the right part. My question is, if second qsort is called after first one is done, then the first one changes parameter for the second one ( it changes left and last). So how it really works?

no it does not, since last and left are passed by value (hence they are copied). So each function invocation has their own left and last The idea behind recursion is to use regular function calls to preserve the state.

You're right. But we don't see other lefts and lasts after the first one is called twice or more 😶

where would you expect to see them?

I expect to see the processes in code, but it's like if an internal function calls itself more than twice, the rest will be done behind doors that I can't see them.

But isn't that the case for all function invocations? x is also "created" twice although the code contains it once. void bar(int x) { (void)x; } void foo() { bar(3); bar(2); }

You're right, it's the case for all of them. By twice you mean first in actual argument, and second in the called function itself (in the braces) ?

In this example, aren't copy's argument passed by value? So why are their state changed in main? Is it because its arguments are arrays?

no since there are two calls to bar

nice rules..😁😁😁

--1, wont it work as pre decrement, and probably give error because 1 is literal?

Yeah not in C/C++ itself