Anonymous
?
Lalit
Star pattern, number pattern
Anonymous
For each patient solving there diff algorithms been followed
Anonymous
Star pattern, number pattern
U can do it using simple coding brother
Lalit
Ok thanks sam
Anonymous
The thing is that if you r an intermediate in c or c++ u can easily use some predefined classes out their to solve Ur problems in easy steps
Anonymous
But if beginner then u can go for loopings
Anonymous
Ok thanks sam
Ur most wlcm bhai
Ghoul
how to find union and intersection of two vectors using STL or may be any other library??
Anonymous
Anyone have c programming tutorial courses?
Anonymous
I_Interface
Youtube is your teacher
Nice phrase btw :D
Anonymous
Ok
Anonymous
Nice phrase btw :D
😂 well thats where I learned programming haha
I_Interface
Anonymous
Ok
Advice from me bro. Not sure if it applies for everybody. Think of a project you want to make. For example, a sinple calculator. Process the logic then try to code it. If youre having trouble what are the syntaxes, tyou can try to search it one by one. Or try to watch it from youtube then try to improve it or at least make it a little different from the video.
Anonymous
Would you recommend that?
I_Interface
Would you recommend that?
ye, esp type deduction from Mayers
Anonymous
ye, esp type deduction from Mayers
Sure. I'll take a look at it later.
Dima
What the fffffffffffff
Francisco
Mat
If i send you a bit of my code, Who can help me if you dont know what the homework asked to me
That's written in Italian. Try to explain in a little message in English what you've done and what isn't clear.
Dennis
Thanks
Rekha
How to find division of C-programming( using only one if case) give me idea please
Rekha
At least 5subject
BinaryByter
what?
BinaryByter
how to find union and intersection of two vectors using STL or may be any other library??
union or intersection in which way? are you looking for patterns or just elements that exist in both vecs?
🐰🐾 سمیه
Exercise 5-17. Add a field-handling capability, so sorting may be done on fields within lines, each field sorted according to an independent set of options. (The index for this book was sorted with -df for the index category and -n for the page numbers')
🐰🐾 سمیه
what this excercise wnats exatly. please explain by examples.
🐰🐾 سمیه
wants
Dima
Lol.
Dima
Well, I think it wasn’t homework request
Rekha
How to find division of c-programming(using only one if)give me idea
🐰🐾 سمیه
Well, I think it wasn’t homework request
why don't you remove the warn?
Anonymous
Guys I can't use glfwFramebufferSizeCallback in an object and I don't understand why
Anonymous
Please can someone help me
Rekha
Please give me idea
🐰🐾 سمیه
somebody remove the warn, i just asked a question😡😡😡😡😡😡
🐰🐾 سمیه
/warn
Hayk
for (int i = 0; i < str.size(); ++i) str.insert(i, 1, ' ') Guys would str become an empty string after the call of insert? I can't understand.
Badugar
But i'm not sure about the 'fields within lines' part ...
Dima
noobs
Anonymous
what does it mean?
Anonymous
🙄
Ибраги́м
Even while using Windows u know it's great to put your taskbar on the left hand side of the screen. Go #TeamLHS
Ибраги́м
noobs
Why do u keep purging indiscriminately
Dima
Why do u keep purging indiscriminately
well it wasn’t something important
BinaryByter
you won't get it in under n^2 lol
BinaryByter
but you should just do a funciton that checks every element for every element
Ghoul
there is no library which does under nlog(n) in any language??
Ghoul
what about python??
BinaryByter
i don't see how you would reduce this
Ghoul
may be hashing
BinaryByter
won't reduce the amount of checks
BinaryByter
but will increase the runtime
Ghoul
okay then thanks
Ghoul
i was doing past google hashcode problem my program is taking hours to generate outpot
Ghoul
😂
BinaryByter
lol what
BinaryByter
what is the task?
BinaryByter
you can probably get the runtime to increase by using threads
Ghoul
thread 🤔
Ghoul
it is not that hard
BinaryByter
thread can be hard depending on how you manage it
Ghoul
but some logic is missing
Ghoul
i will try then
Ghoul
thanks again
Dima
use fibers
Ghoul
for(int i = 0; i < n; ++i) { std::cout << i <<" \n"[i == n-1]; }how it is working ??
Ghoul
" \n"[i == n-1]