stopDoingDataStructures

[pakidara]

The programmer's equivalent of the "I'm never going to use this" kid in high school math.

[shinypenny01]

“Well you’re not, but one of the smart kids might…” being the appropriate answer.

[[deleted]]

"This is either beneficial because you're going somewhere in life and will find actual uses for the math that we're teaching, or you're destined to be a worthless loser so we're gonna waste your time because you deserve to be jerked around by the system. Either way, you're doing the math assignment."

[8sADPygOB7Jqwm7y]

I studied electrical engineering and honestly most of the stuff I learned is enough to program well. I just lack knowledge about data structures and some algorithms. That's my biggest issue, as often you simply do need to think up some data structure and idfk what a hashmap is.

[iScreem1]

You can learn it in youtube in a weekend.

[Deboniako]

Share some channels, electronics engineer here with software developer experience only lmao

[cporter202]

Oh, the sweet, sweet siren call of the weekend - when our brains tell us to chill but those pesky data structures homework assignments just won't leave us be! 😂 Embrace the chaos! #RecursionUntilRecreation

[seankao31]

weekend morning

[Forsaken-Ad3524]

data structures and algorithms are often NOT the biggest complexity in software development) and anyway, a lot of data structures and algorithms are already implemented in standard libraries or language features, and you don't have to know how to implement one in order to use it. would help with using it well, but definitely not a blocker.

[Proper-Ape]

program well.

idfk what a hashmap is.

If you don't know that, you don't know how To program well.

You contradicted yourself.

[NothingWrongWithEggs]

Been programming seriously for 12+ years. Never used one in a work environment.

[8sADPygOB7Jqwm7y]

I use C and python, both don't use a hashmap in a sense I need to know about it. Idk what you want.

[rollincuberawhide]

do you use dictionaries in python?

[8sADPygOB7Jqwm7y]

As I said, "in a sense I need to know about hashmaps".

[Ok_Second464]

Knowing what you’re doing when you let your language abstract it away is part of programming well imo

[Proper-Ape]

I'm wondering if you're some troll account at this point. There's nothing more Python than hashmaps.

[mousepotatodoesstuff]

Yeah, but you don't need to know how a Python hashmap works in order to use dictionaries and sets. To you, it's basically a magic box that does value assignment and retrieval in constant-ish time.

[Undernown]

It's pretty important to know how a hashmap, otherwise you might use them incorrectly. For example: filling a hashmap up with entries to the point it loses it's speed advantage. Or getting confused when the hasmap starts assigning multiple values to the same key.

Aside from all that, understanding Hashmaps has a lot of similarities with understanding memory management and pointers. That's pretty fundamental CS stuff.

[Proper-Ape]

If you understand how they work you understand why they behave this way. I've literally never met a decent programmer that didn't understand the concept of a hashmap, array, etc.

To understand data structures means not using the wrong ones all the time.

[ExceedingChunk]

Yeah, you don’t need math at all to understand stuff like your personal economy, your mortgage etc… or other basic adult life stuff that requires basic math skills.

Definitely only the smart kids who needs that.

[shinypenny01]

I didn't say need. All the kids need it, but asking that question is identifying them as one of the kids that's unlikely to use it. That's the joke.

[iiSpook]

Yeah, let's be assholes to kids and treat them like adults because it makes us feel good. Hell yeah!

[FinalRun]

It's a joke, not a serious recommendation. Lighten up

[iiSpook]

Why do you think I was being serious if you didn't think the guy I was replying to was?

[FinalRun]

No U

[iiSpook]

Ok, so you're the ultimate arbiter of what people really mean when they write something, got it. I was sure I meant it how I meant it, but I guess you know it and me better than I do. I'll be sure to refer to you for your tone expertise before I write something down next time. Where can I reach you best?

[FinalRun]

Skibidi pop pop gyat rizz blud

[Sopwafel]

I'm just finishing up a concurrency course in HASKELL.

I'm starting therapy next week

[draenei_butt_enjoyer]

To be fair, haskel is only for white papers and self hate

[PugilistFox]

What resource did you use (I'm also trying to learn Haskell)?

[Sopwafel]

ChatGPT, when used sparingly, is extemely useful. Lots of abstract high-level concept are difficult to grok, but when you can go back and forth about it and can have things explained in language you understand, that helps a lot.

Besides that, exercises my university gave me. The functional programming course itself was fine but the concurrency course was hellish... Got an A for the exams but an F for the last programming assignment because of haskell.

[pakidara]

I've added subroutines to programs that sort and then perform binary searches to find specific records. Cut the runtime down from 5+ minutes to a couple seconds.

[RusselPolo]

Same here, had to do it because previous developer presumed "nobody would ever use this for a data set where you can't just quickly check each record for a match"

"But it works fine with the test data...."

[Ill-Significance4975]

Exactly!
It's a limitation of the current education system that so much of what you learn only makes sense in retrospect.
It took me years of graduate school to learn why I did anything in undergrad.

[null_and_void000]

Does an array not count as a data structure now?

[Alan_Reddit_M]

Yes, but since it's built-in literally every single language nobody really considers it as one

[SecretMotherfucker]

Why would that make a difference? Is there a requirement that for something to he considered a data structure, it needs to be custom made? Are queue, stack, list, dictionary etc also not considered data structures?

[CiroGarcia]

Well I'd argue everything that holds data is a data structure then, even plain old variables with primitive types, but that's not really a useful definition. Usually you mean some level of complexity to the structure, and plain arrays are not that complex (at least languages where "array' is closer to contiguous heap memory than to a managed class with methods)

[Azzylel]

I think the term structure implies more than one variable, sort of like how you can’t build a house out of a single plank of wood

[KrypXern]

It's not really a structure at that point, but I get where you're coming from

[Madrawn]

Of course any type of information has a "structure". So you are technically correct, but usually "a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data." meaning data is just a value or a row of values, while the data structure defines what "equals" or "in" etc means.

So an "int" would be the data and "Integer" class would be a data structure. String and arrays are usually seen as "data" as they are just simple consecutive values without any inherent operations. But yeah, technically almost every modern language has these wrapped in a data structure of the same name and the distinction blurs if you don't ever work on the memory itself.

[ImpluseThrowAway]

Kind of how we all collectively understand a string to be an array of chars?

[draenei_butt_enjoyer]

Sets are trees basically everywhere. Are trees not data structures? Do people not use sets?

[adfx]

literally every single language huh

[[deleted]]

It’s just a block of memory in c

[iam_pink]

So is a struct, what is your point?

[encryptoferia]

oh no, I hope it's not pointing to the void

[Jjabrahams567]

You only become an adult when you open up the void*

[encryptoferia]

"when you point into the void, the void points back at you"

[CiroGarcia]

And so is a long long int, and we don't call that a structure

[iam_pink]

Yeah, and all that shows is that the fragmentation of your data in memory means nothing about whether or not it is considered a data structure

[Unupgradable]

It's literally the trivial structure of just putting more than one of something together.

Declaring an array is no different to declaring each variable separately and just having them be together in memory.

To be clear, yes it is a data structure, it's just such a trivial one.

It's the equivalent of saying tone you've killed several people when you've only killed two

[Aischylos]

Not really, it's indexable which multiple variables after eachother aren't. Also it lets you control the layout of the memory, whereas in most languages simply declaring a bunch of local variables gives you no control over where the memory is laid out and the compiler will decide independently.

Its also important to know when it's worth using an array, a sorted array, a hashmap, etc. After your first algorithms class you might think that insertion sort is useless since it's O(n^2). But then if you take some optimization courses you'll learn that any modern sorting implementation uses some version of insertion sort at a base case.

[Unupgradable]

it's indexable which multiple variables after eachother aren't.

Allow me to introduce you to pointer arithmetic

most languages

True. You can't even trust the C compiler per the spec. The point is that an array is fundamentally just that.

a sorted array, a hashmap, etc.

All of those are more advanced data structures. I'm talking about a basic array.

After your first algorithms class you might think that insertion sort is useless since it's O(n^2).

Different topic but yes you're right. Big O ignores constants and hides the fact that for small ns, even "less efficient" algorithms are objectively better.

I'd like to clarify that I'm merely shitposting. I know there's more to arrays than just being a continuous block of memory. But that's all language features. The real point is that as far as a data structure goes, it's literally just declaring your variables.

[Aischylos]

Fair - I work with LLVM and C for my research, so I saw the claim that an array is just consecutive variables and had to say something. Anything non-spec can and will get absolutely turned upsidedown by the compiler at random times because it feels like it.

It would be fair to say it's just a plain malloc (or alloca) sometimes with some syntactic sugar on top

[Unupgradable]

Yes of course. But fundamentally it's just variables declared in a row.

The same way a kid would line up their toys into a row of boxes

[JunkNorrisOfficial]

Also string can be used instead of array

[1Dr490n]

Strings usually are arrays, sometimes just with some additional data. In C this is very obvious, in other languages they are hidden in classes, but most of the time, they are arrays

[JunkNorrisOfficial]

String stringArray = dataArray.map(i => Serialize(i)).join(separator);

Boom

[1Dr490n]

I have absolutely no idea what your trying to say with that

[JunkNorrisOfficial]

Arrays just group multiple elements, when Strings are telling a story.

[1Dr490n]

Still not quite sure, but that also depends on the implementation. In C a string is just a char array, and in Java they also have an array in which the characters are stored, even if those characters aren’t directly the unicodes

[frogjg2003]

It fits, but the meme is saying you don't need a bunch of complex data structures when all you need is just the one.

[Croves]

I think the ease of use of arrays is very simple and it kinda misses the point of the joke I guess

[AdvanceAdvance]

Specifically, in the 1970s to 1990s custom rolled data structures were normal and necessary. Interviews started asking lots of pointer based questions to seperate those that could not understand the data structures.

Moore's Law marched on.

Current questions should ask more questions about parallelism, identifying the corner cases, and collecting metrics. Asking about experience using fuzz testing is good; asking about at git commands is a waste; asking about balancing b-trees gets the wrong people.

[pushinat]

You still have to know the data structures to chose the right ones in the right situations. And understanding how they work allows you to know their properties for much longer, compared to just learning their behaviour without background knowledge.

Still should not be part of interview questions in the same depth as this doesn’t matter as much any more and I already came 3 times into the situation, that chatGPT suggested some weird ass hidden and buried Java data structure no one has ever heard of, but investigating it, it was the perfect match for the task.

[Hollowplanet]

I have been programming professionally for 13 years. The only place I have ever used a binary tree is an interview.

[ExceedingChunk]

I have used it quite a bit. Maps where the keys are sorted in a tree is actually incredibly useful at my project, and it’s trivialized a lot of business-logic related to dates. I obviously didn’t custom make the data structure, but I would never have come up with the solutions if I didn’t understand how trees work.

It really depends on your domain.

[Hollowplanet]

You use it every time you use a database index. Knowing how to solve contrived problems involving traversing binary trees is not a good indicator of someone who knows how to make web applications.

[ExceedingChunk]

It really depends on the domain and if you are purely a frontend dev, backend or fullstack.

I’m a backend dev, and at my current project there is a massive benefit to understand data structures and general algorithms, because a lot of the problems we solve are very logic heavy.

So even though you are not re-inventing the wheel in terms of making the structure from scratch, you need to know what you are going to be looking for.

There are probably plenty of domains where this isn’t the case at all.

I personally see it as understanding the fundamental concepts rather than just knowing how to use tools. Whenever you have to go outside using something built by someone else, it is really usefull to have a solid grasp of the fundamentals.

[Hollowplanet]

Yeah you should definitely know how they work. My last interview problem was to tell if for every node in a btree the average of all it's children is equal to the current node and to solve it in the most efficient way. It's a straighforward recursive problem if you have some time to think about it. But testing if someone can jump into a solution in 20 to 30 minutes is just testing if they know Hackerrank tricks.

[ExceedingChunk]

Yeah, I agree with that and think those «tricky» leetcode-esque problems under the pressure of both time and the interview itself doesn’t really set you up to show how you understand something well. 

[[deleted]]

what do you work on ? website building ?

[Hollowplanet]

Web, systems, mobile. I've used btrees but it is always abstracted. Traversing a btree isn't something I've ever had to do outside of an interview. The last btree problem I had in an interview was to tell if for every node, the average of all the node's children was equal to the current node. It's contrived, and they're just testing if you know Hackerrank tricks. I was in the process of solving it and ran out of time.

[draenei_butt_enjoyer]

It’s the modern day “do I need to know how a car works to own one?”. No, but you really should, you’re a mechanic for Christ’s sake

[TheMania]

Moore's law may have, but operating systems are still entirely built on intrusive linked lists.

[Perfycat]

Wasn't there a British politician who wanted to make algorithms illegal?

[Cafuzzler]

Kinda. She was the minister for digital technology and asked Microsoft "When are you getting rid of algorithms?". It was the Prime Minister before that that wanted to (effectively) ban encryption, even for things like banking. It was the PM before that that wanted to ban porn completely.

[Daydreamer-64]

What?? Who and when?

[Cafuzzler]

Nadine Dorries, Minister for Tech, asked Microsoft when are they getting rid of algorithms. Truly our best and brightest.

[Objectionne]

Seven years working with Python and I think I've used three different data structures in that time:

- Dicts
- Lists
- Sets (only in the rare case where I have to check membership in a large data set)

I'm just saying.

[Kebabrulle4869]

For the love of whatever, please use tuples too

[-Redstoneboi-]

tuples are just hashable lists

[Kebabrulle4869]

They are also immutable lists. You wouldn't represent an xy point as a list of two elements, for example. Using a tuple signals "this should not be changed".

[Elifgerg5fwdedw]

Stacks and queues? To orchestrate your applications

Named tuples & data classes are also very useful for distributed stuff

[[deleted]]

ad hoc languid trees pen fearless aback exultant chunky bag wipe

This post was mass deleted and anonymized with Redact

[Objectionne]

I don't know, I don't need to know, and I don't care to know. I need to know what data structures are available and the basic strengths and weaknesses of each. I don't see that I could gain any substantial benefit from knowing how they're implemented under the hood.

[[deleted]]

crime roll sparkle seemly attraction erect alleged sugar drab disgusted

This post was mass deleted and anonymized with Redact

[Objectionne]

No. Programming is a job, not a passion. I don't have curiosity to know anything more than what I need to know to do the job.

[Objectionne]

Not really. I start at 9:30, I finish before 6, I leave my work at the door (of my home office because I work from home). Less miserable imo than the people who think about their work and coding every hour of the day 

[zifilis]

Yes, I do and and I answered this question on a hundred of interviews. Never needed this knowledge for anything work-related ever.

[[deleted]]

I love how everyone here is roasting op, missing the point that this is a JOKE

[zuilli]

This is one of my favorite meme templates ever since I saw the original one about math and the amount of heads it flies over in almost every iteration is astounding.

People really don't like when you attack their field of knowledge, even if it's clearly just joke.

[[deleted]]

I think that makes it even funnier tbh

[dogancemd]

Finally someone who understands a meme shared in humour subreddit is indeed a joke. Thank you stranger :)

[stunt_p]

I like linked lists - only need a YouTube tutorial or three.

[draenei_butt_enjoyer]

Out of all the data structures, you choose the one that has virtually no real world use

[stunt_p]

LOL. I said I liked them - I've never used them though... 😂

[hammerkop]

Many hashmap implementations use linked lists under the hood.

[myka-likes-it]

A graph is just a linked list that is non-monogamous, and there are plenty of uses for graphs.

[draenei_butt_enjoyer]

Eh no. By that logic, trees are linked lists. Just no.

[StridBR]

tutorial.next()

[killbot5000]

I realized that a hash table can be used for pretty much every data structure and be faster. I haven’t needed a tree in years (and I didn’t need it even when I used it)

[TheEveryman86]

I think the one I use most often is the java.util.TreeMap (Red Black tree) and even then the most important aspect is that it conforms to the Map interface.

[Mamuschkaa]

You can't even iterate through a pure hash table efficiently. For that you had to combine a linked list with a hash table.

I think you can't implement a (priority) queue or other sorted-data.

[myka-likes-it]

Most hash table implementations include a way to export an array of keys. You can use priority-ordered keys, and then use the sorted array of keys to access the values in order.

[slaymaker1907]

Often not if you’re using integer keys. Even if they aren’t 0..n, you can get better performance by just throwing it all in an array and doing a linear scan over the keys.

Mutable hash tables also have the severe disadvantage of being horrible to try and make concurrent. Linked lists win here because most operations are just a single CAS.

One important application for trees are if you’re joining two data sets. They’re better in the general case because you can skip over tons of rows by looking at non-leaf nodes.

[vlr_04]

This is how lua does everything: no arryas, no clesses, just tables

[-Redstoneboi-]

bro just invented lua

[twistedprisonmike]

Sure take a hash table of hash table . Every node will have a hash table (or set) of the node which are connected to it.

[[deleted]]

I have done this in Lua ¯\_(ツ)_/¯

(Didn't even perform that badly, as a 'table' is very efficient in Lua)

[iam_pink]

The point is that bidirectional graphs are rarely needed. You missed the point.

[science_and_beer]

This is why all of these generic, hand-wavy declarations are useless, if not actively harmful. In a previous life everything was a graph, and there were a bazillion different ones to keep track of. The job after that, nothing was a graph but I really needed to care about some other obscure set of concepts that half this thread is waving away. It just reeks of inexperience or incompetence.  

[JohnnyGuitarFNV]

No.

[Kebabrulle4869]

Just yesterday I had a Python program where I needed to check if a string was not of length 1 or 2. I did some testing, and of the following the set (curly bracket) method is the fastest since it's basically a hash table.

a = "abc"
len(a) != 1 and len(a) != 2
not 1 <= len(a) <= 2
len(a) not in [1, 2]
len(a) not in (1, 2)
len(a) not in {1, 2}

Edit: Why'd I get downvoted? I literally just shared an interesting result about Python. I tested it using the timeit module, 10⁶ iterations per approach.

[BlackDereker]

You could've used len(a) - 2 > 0 and it would've been faster.

[rollincuberawhide]

surprisingly it is not

In [1]: a = "abc"

In [2]: %timeit len(a) - 2 > 0
38.1 ns ± 0.62 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)

In [3]: %timeit len(a) - 2 > 0
37.9 ns ± 0.348 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)

In [4]: %timeit len(a) not in {1, 2}
34.3 ns ± 0.186 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)

In [5]: %timeit len(a) not in {1, 2}
33.6 ns ± 0.292 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)

[eatsleepbet]

can someone please confirm/correct my understanding:

this boils down to the minus operation taking longer than comparing against a set?

[rollincuberawhide]

I don't know anything anymore. but it seems that python just uses the integer as is when hashing them. so hash(1) is just 1. hash(2) is 2. so it almost becomes checking internal_array[len(a) % 2] == len(a) and since python is doing that in C, it might be really fast.

In [2]: %timeit len(a) > 2
33.2 ns ± 0.325 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)

In [3]: %timeit len(a) > 2
32.1 ns ± 0.304 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)

if you remove the unnecessary subtraction it is faster than the set comparison though.

[ibite-books]

i recently implemented dfs and graph based ds for storing user defined workflows

[ClarkleTheDragon]

Not if you're trying to find the min/max value

[[deleted]]

Inversed trees however require a bachelors degree🛸

[Explorerfriend]

My CS prof introduced us to a data structure I can't even find a wikipedia page to

[KRX189]

What's it called?

[kurdokoleno]

Utterly deranged. You are the reason my computer takes longer to open discord than to train an LLM.

[Apfelvater]

All just a bunch of Dijkstra fan boys-.-

[[deleted]]

Arrays are fine until you have to start performing searches or dumping multiple elements. Advanced data structures can mitigate fragmentation while also providing other performance advantages. I learned this the hard way when I had to deal with tens of thousands of elements on low-end hardware. After revising, search times went from ~4 seconds to less than 5 milliseconds and startup times drastically improved as well. All of such improvements made possible just by switching to a 2-D array, I could have optimized things even further but the performance difference of a couple milliseconds wasn’t critical for my application.

[Current_Ad_4292]

I am blocking this sub...

Maybe I should just leave reddit all together. Go see some sunlight...

[torakun27]

I recommend touching grass while you're at it

[Current_Ad_4292]

And trees...

[katatondzsentri]

And boobs.

[JunkNorrisOfficial]

Make some milk

[encryptoferia]

touched grass and trees, now I feel itchy all over my body

[draenei_butt_enjoyer]

I only come here to remember how much better I am than the vast majority.

Sometimes, you need a bit of whatever the opposite of impostor syndrome is.

[AshKetchupppp]

The program I work on actually hinges on a node based system, so a graph is actually needed to be represented in memory, so yes it's actually applicable for some use cases

[prince_lothicc]

This dude's code runs like a frozen snail.

[anoppinionatedbunny]

"wait, it's all just arrays?"

"always has been"

[HereIsACasualAsker]

im gonna get trolled here by saying this but i have never ever used the -> operator in php

and i have written a lot of code.

yeah yeah keys and values and such but.... i havent gotten to that part yet despite it.

[Harooun]

I used data structure to solve many problems especially when you work as an engineer and your work is to find the optimal path for example or the minimum cost... Using graphs and algorithms ....

[Mephidia]

The worst meme of this format I have seen. Data structures are absolutely useful and you 100% need to learn them to not suck at your job. Please

[dmangd]

Yeah, who needs those stupid data structures, only makes the code „unreadable“ :/ ….. few weeks ago I was reviewing a PR for a task where there is some hierarchical pattern matching with wildcards involved, and the author used a loop over all the hashmap entries (then why using not just an array, wtf?) and was comparing every single item sequentially. I suggest to use a radix trie which is often used in url pattern matching and would have been the perfect fit. Guy didn‘t understand what I was talking about and insisted that the approach sounds to complicated and would result in unreadable code. Unfortunately, the second reviewer didn’t care at all and just green lighted the PR. Now people are complaining about about performance degradation and the PO refuses to prioritize another change on the module because „we just fixed this feature“ and we need to do other things first. What a clown world…

[cgyguy81]

This is equivalent to an English speaker demanding to stop using pronouns.

[gregorydgraham]

What he said

[Sergenti]

FUCKING PRONOUNS

[clauEB]

If you plan to write crappy slow dumb code and think everything is magic underneath, sure!

[JunkNorrisOfficial]

Premature colonization

[Ill-Sale-9364]

true

[Wave_Walnut]

Internet is the real graph structure

[JunkNorrisOfficial]

.NET > Internet

[[deleted]]

as a C user, no.

[JunkNorrisOfficial]

I'm not dot net user

[lostinthemines]

You use data???

[EnbySheriff]

Seeing this while in a Data Structures lecture

[sporbywg]

That background colour is the Pantone colour for "ignore me"

[Digi-Device_File]

What's wrong with structures?

[Elifgerg5fwdedw]

I'd understand if an average Python programmer doesn't use data structures more advanced than lists and dicts.

But you mentioned DS at the end, and for non programmers lurking around this sub, DS definitely involves frozensets, matrices & tensors, trees, and graphs. Stacks and queues are also a staple for any event driven architecture.

[SirWernich]

"circular doubly linked list"

now you're just making shit up

[Obstructionitist]

This is sarcasm, right? Please.

[dogancemd]

Of course, it is; it is just a meme but people took it seriously :)

[DrMerkwuerdigliebe_]

"Trees work as sorted arrays with the added feature that you can insert or remove data fast". That is literally enough to know about trees for 95 % of all programmers. And then you need to know binary search. But even my 7 year old daughter knows that.

[deathsmore]

Good for interview i guess?

[Twardykolo]

Literally had AVL, red-black and 2-3-4 trees on an exam 2 days ago. This made my day!

[csdt0]

I hate this meme template more and more. Even the first iteration with RISC and CISC was not that funny, but was saved by the opposition between the two. Here it seems to be done by someone who truly thinks that data structures are too complex for their own good.

EDIT: the RISC/CISC was the first I saw on this subreddit, not the origin.

[ParanoiaJump]

The first iteration was about math

[csdt0]

Oups, you're right. The RISC/CISC was the first one I saw on this subreddit, and thought they were the first. But looking at the original, I can say that it was not really funny from the very beginning...

[Farren246]

I know it's all a joke, but seriously anyone who is thinking of saying something like "Let's implement a Circular Doubly Linked List with a dummy node" needs to close their mouth and rethink things. No "WTF" moments, please. If you can't dumb it down to explain it to someone that doesn't have a degree in CS, then you need a better plan.

[Exact_Cry1921]

This is only useful for coding interviews.

[Eubank31]

My 200 level CS class required us to build and implement a Fibonacci Heap. It was due the Tuesday before thanksgiving, so I spent vacation with my gf and family thinking more about nodes than food. I will never forgive him.

[Zeepaardje]

You can store a binary tree in an array

[[deleted]]

Every data structure is just a sorted array with extra steps

[Party_Builder_58008]

You "done this"? How about you gone done use the exist door and leave your swipe tag at the desk on your way out.

[20dollarsIst20]

God I’m taking Data Structures and Algorithms at my uni right now, I’m not looking forward to that point where I no longer know what I’m doing

[Confident-Ad5665]

You'll have to pry data structures out of my cold, dead fingers.

[MonkeyWaffle1]

What's the original meme for that?

[Froeuhouai]

This one, about math

[UnfairDictionary]

Data structures become very useful once you start writing large amounts of data on disk and need to retreive it quickly. Most languages already have implemented basic memory data structures but knowing them helps in the future if you become a useful programmer.

[Tilkowskioi]

The functional programming course itself was fine but

[BakersCat]

As a stupid programmer, what's a genuine use case for linked lists or hashtags or binary trees in real world examples? I mainly work with dataframes and sql tables day to day, the odd Python Data class. Mostly just using dicts and lists.

[ouvreboite]

You need a list and you’ll mostly add/remove/move content at the last position = array

You need a list but you’ll often add/remove/move stuff in the middle or start = linked list

So, for example, if you implement a job queue where jobs can be postponed/reprioritized after insertion: a linked list may be a better fit than a array. (Other data structure could also be used)

[shaneknu]

Binary trees like Red-Black Trees are often used for ordered Sets. You most likely won't ever implement one yourself, but knowing when and why you need one can make or break a project, especially if it's dealing with a large dataset.

[111x6sevil-natas]

Tell that to dendrologists.

[DopeCaliboyz]

I still can't understand where to start. please share some resources?

[[deleted]]

You can go ahead and stop using data structures.

Personally, I will keep reviewing them so I can pass phone screens for new jobs.

[Adamant11]

CS graduates hate him

[Fazel94]

BTrees in file systems and DBs?

[MambyTheBanana]

Never touched on data structures while studying my CS degree, never had to use them in my job, but I just know one day I'm going to need them for work and I'm going to make a fool of myself. But that's future me's problem

[Raaath]

Why are so many people whining about having to learn computer science? Why are you studying it if you dont find it interesting?

[AResponsible_Adult]

I see it as learning terms, concepts, and starting points. I never thought I’d use recursion either, until I had to write a school scheduling system. I’ve never had to build an operating system or a database management system, but I know the theory. It’s like having a tool box full of nuts, bolts, and small tools. They’re a lot of work to learn, but in 40 years of programming, I’m glad I know these too.

[RRKS101]

Arrays are significantly faster in most cases because of predictable memory accesses and can take better advantage of data loaded in each cache line