I'll try

If someone want to say something more, u are welcome

If someone want to say something more, u are welcome

Build a console tetris game

That, ll get u worked up

Where Can I Learn Data Structures In C ?? For Free And Complete Understanding

Where Can I Learn Data Structures In C ?? For Free And Complete Understanding

MIT's introduction to algorithm, on YouTube

What project should i do to learn more C++?

Start with some basic games like Tetris, tic tac toe etc. You can get the content from youtube

I just learned this year some Data Structures

Btw how much time did it take to learn data structures and algorithms??

I know it has nothing to do with the group but it doesn't load the image that should be in the header

Thank for findings :)

Btw how much time did it take to learn data structures and algorithms??

I am doing a course on data structures and algorithms...and its a 6 months course

Btw how much time did it take to learn data structures and algorithms??

But u need to have prior knowledge in c and c++

/programming

/programming

Is digital electronics an important subject for placement purpose in computer science branch??

And computer organisation also

Thank for findings :)

You're welcome

int recursiveSum(int N) { if(N==0){ return 1; } return N+recursiveSum(N); //Your code here //Recursively sum from 1 to N and return }

I am getting segmentation error in above program cann anyone tell me why?

what is your N?

how do you call function? maybe this is stack overflow

I see the problem. change return N+recursiveSum(N) to return N+recurseiveSum(N-1)

int recursiveSum(int N) { if(N==0){ return 1; } return N+recursiveSum(N); //Your code here //Recursively sum from 1 to N and return }

You don't change N from call to call

You don't change N from call to call

The rest is UB in it's finest

@kasha131 @VoiDDoc0x0TheOriginal thank u for pointing out error i was stuck with this problem for several time thank u

once agin

/warn non English, request for pirating, offtop

how to understand the use of overloading operator () in a class? i can understand overloading ==, +=, & and other operators, but don't quite understand the () operator

how to understand the use of overloading operator () in a class? i can understand overloading ==, +=, & and other operators, but don't quite understand the () operator

struct fixed_multiplier { int multiplier = 5; int operator()(int multiplicand) const { return multiplicand * multiplier; } }; int main() { fixed_multiplier fm; std::cout << fm(4) << '\n'; // 20 std::cout << fm(5) << '\n'; // 25 fm.multiplier = 10; std::cout << fm(4) << '\n'; // 40 std::cout << fm(5) << '\n'; // 50 }

how to understand the use of overloading operator () in a class? i can understand overloading ==, +=, & and other operators, but don't quite understand the () operator

It is operator to call things

how to understand the use of overloading operator () in a class? i can understand overloading ==, +=, & and other operators, but don't quite understand the () operator

A class with operator() overloaded makes its objects callable. There is a term for these callable objects — functor.

Btw how much time did it take to learn data structures and algorithms??

I learned in one semester at College

Around 4-5 months

Photo from .

Photo from .

Someone solve question 3 and 4 using C language only

Hi

Why ? What happened ?

Hi everyone I have a question about memoization. I have used fibonacci calc with memoization and in main.cpp, I use it twice so I declared a static int array, but when I called it function for the first time, second called same function's performance are affected by the first one although array value is static. Anyone to help, appreciated! In output page , please only look at recursive with memoization and see the difference. When I call F[40] first, F[10] done in 1 step because it uses same unchanged array although it is static. You can contact me too i would be appreciated.

.

I don't understand .

What are you trying to say ? @waldo336

I don't understand .

read the pinned message for f**k's sake

What kind of language you people use !

I was just asking for help

It's ok if you guys are super intelligent or something but in order to learn I am asking a question and you guys are flagging pinned remarks

You don't tell me what to do and what not to do .

It's ok if you guys are super intelligent or something but in order to learn I am asking a question and you guys are flagging pinned remarks

Dude. The group is meant for seeking help if you are stuck not seeking entire solutions

And I hope someone insults you exactly in the same way as you insult some stranger who is asking for help

Dude. The group is meant for seeking help if you are stuck not seeking entire solutions

Its ok

Its ok

If you've written code, and its not working, send the pic of that here. We can point out what's wrong and suggest. Don't get mad. Also do read the rules

If you've written code, and its not working, send the pic of that here. We can point out what's wrong and suggest. Don't get mad. Also do read the rules

Ok I will keep the rules in my mind next time

Is it a good idea to use std::list with elements and std::map to associate keys to iterators from the list if I need a FIFO queue with ability to find any element from the queue (to remove from it, for example)? E.g. std::list<Element> queue; std::map<KeyType, std::list<Element>::iterator> searchMap;

Is it a good idea to use std::list with elements and std::map to associate keys to iterators from the list if I need a FIFO queue with ability to find any element from the queue (to remove from it, for example)? E.g. std::list<Element> queue; std::map<KeyType, std::list<Element>::iterator> searchMap;

You can use unordered map

You can use unordered map

Instead of map?

Is it a good idea to use std::list with elements and std::map to associate keys to iterators from the list if I need a FIFO queue with ability to find any element from the queue (to remove from it, for example)? E.g. std::list<Element> queue; std::map<KeyType, std::list<Element>::iterator> searchMap;

This is a basic idea how LRU cache can be implemented

Instead of map?

Yes

Is it a good idea to use std::list with elements and std::map to associate keys to iterators from the list if I need a FIFO queue with ability to find any element from the queue (to remove from it, for example)? E.g. std::list<Element> queue; std::map<KeyType, std::list<Element>::iterator> searchMap;

you can use map with overloaded operator< to serve as FIFO

you can use map with overloaded operator< to serve as FIFO

The order in the queue and the key to find an element are different and can be in different order. So I would need to have another dictionary to associate one to another

The order in the queue and the key to find an element are different and can be in different order. So I would need to have another dictionary to associate one to another

use composite key like pair<KeyType, FIFO_criteria>

+overloading of operator==

Thanks guys, will look closer at the suggestions

ok, I am not sure about operator==, I don`t know what is your FIFO criteria and key

but you can find element using map.find and compare key by your own

https://i.imgur.com/J5oEfbt.png Bye! visual studio

https://i.imgur.com/J5oEfbt.png Bye! visual studio

My install fcked itself up, It fails to find the windows 10 sdk version....

what’s your next Ide?

I can't build anything it always failes

Just reinstalling VS

https://i.imgur.com/8pgTNvs.png I kept getting errors like this

https://i.imgur.com/KN1bWFG.png

That SDK version even was installed...

I might just go for 2019 VS

My install fcked itself up, It fails to find the windows 10 sdk version....

Do you even Linux? ;)

For servers

For desktop windows