>my favorite data structure is the Linked List

>my favorite data structure is the Linked List
What type of person do you imagine?

Homeless People Are Sexy Shirt $21.68

Unattended Children Pitbull Club Shirt $21.68

Homeless People Are Sexy Shirt $21.68

  1. 3 weeks ago
    Anonymous

    picrel is hashmap enjoyer

    • 3 weeks ago
      Anonymous

      picrel is a skiplist enjoyer

    • 3 weeks ago
      Anonymous

      hashmap is the quintessential redditor CS101 favorite data structure

  2. 3 weeks ago
    Anonymous
    • 3 weeks ago
      Anonymous

      list ≠ linked list

  3. 3 weeks ago
    Anonymous

    one who loves simplicity

  4. 3 weeks ago
    Anonymous

    Someone who doesn't understand cache locality. If it can't fit in an array, it shouldn't be in the same structure.

    • 3 weeks ago
      Anonymous

      >What type of person do you imagine?
      favorite? then it's someone who overcomplicates everything and doesn't give a frick about cpu caches.

      CPUs are so fast nowadays that cache misses cost next to nothing.

      • 3 weeks ago
        Anonymous

        Cache miss is a death sentence for the modern CPU. The only reason they are fast at all is because they're good at not missing the cache. There is a reason why cache takes up over a half of the CPU die.

      • 3 weeks ago
        Anonymous

        You're a complete and utter morono, and I'm not even going to throw you the bone.

      • 3 weeks ago
        Anonymous

        No, dipshit, cache misses get WORSE as the CPU gets faster. You're stalling more ops for the same latency. First word memory latency has gotten slightly longer over the years, so if anything it's more important now than ever.

        • 3 weeks ago
          Anonymous

          There's like 5 layers of indirection before the address in a program gets translated to an actual physical address in RAM. This shit adds up fast.

      • 3 weeks ago
        Anonymous

        >t. java developer
        >durgasoft certified

      • 3 weeks ago
        Anonymous

        its the exact opposite.
        CPU have become so fast that memory speed lags horribly behind, which means that cache misses are more costly than wasting dozens or hundres of CPU cycles.

      • 3 weeks ago
        Anonymous

        Good morning, sir.

  5. 3 weeks ago
    Anonymous

    Full time interviewer.

    • 3 weeks ago
      Anonymous

      Someone who's on leetcode too much.

      Nocoder interviewer

  6. 3 weeks ago
    Anonymous

    Someone who's on leetcode too much.

  7. 3 weeks ago
    Anonymous

    Nocoder interviewer

  8. 3 weeks ago
    Anonymous

    >What type of person do you imagine?
    favorite? then it's someone who overcomplicates everything and doesn't give a frick about cpu caches.

  9. 3 weeks ago
    Anonymous

    Average Amiga developer.

  10. 3 weeks ago
    Anonymous

    I bet 90% of the people ITT think arrays will save them from cache misses and then go on to keep object references/pointers in the array anyway.
    >visiting for loop goes brrrrrr
    (Now obviously if you're going to use a linked list, at least embed the links in the objects themselves.)

  11. 3 weeks ago
    Anonymous

    webdev

  12. 3 weeks ago
    Anonymous

    what kind of moron has a favorite data structure?

    • 3 weeks ago
      Anonymous

      My favorite data structure is a rope. I use arch btw.

      • 3 weeks ago
        Anonymous

        Ropes are great for sad std::strings

    • 3 weeks ago
      Anonymous

      I like hashmaps

    • 3 weeks ago
      Anonymous

      My favorite data structure is a male penis

    • 3 weeks ago
      Anonymous

      The best data structure in an expanding array list with pointers pointing to other elements allocated in the heap. When the array fills up I allocate a new array and I have the last one point to the new one. Nice and simple with cache locality and easy to implement. Best of everything.

  13. 3 weeks ago
    Anonymous

    A lisp weenie

    • 3 weeks ago
      Anonymous

      the only correct answer

  14. 3 weeks ago
    Anonymous

    are there any architectures where you can have a pointer to a register? also perhaps having say thousands of registers... could maybe make a fast linked list

  15. 3 weeks ago
    Anonymous

    Someone who writes C, but in a terribly outdated boomer style. Their build system is a mix of make, awk scripts, perl scripts, and autoconf. They use preprocessor macros for the most trivial things. They liberally use gcc extensions but won't use basic C99 features. They have a nest of owning pointers, each getting its own lifetime and alloc/free - an outdated and terrible design (C++ programmers still do this but they just slap smart pointers on top.) They have never heard of the word "const" in their life. The only integer type they use is int. They might use gdb but they sure as hell don't use any sanitisers.

  16. 3 weeks ago
    Anonymous

    >his cpu can't prefetch pointer dereferences
    ngmi

    • 3 weeks ago
      Anonymous

      >guess fetch a ptr
      >leak a password
      What did Apple mean by this?

  17. 3 weeks ago
    Anonymous

    Very nice anon
    I personally prefer statically allocated arrays myself

  18. 3 weeks ago
    Anonymous

    An imaginary person.

  19. 3 weeks ago
    Anonymous

    one of yahweh's chosen

  20. 3 weeks ago
    Anonymous

    a cnile who hates performance

  21. 3 weeks ago
    Anonymous

    a java dev

  22. 3 weeks ago
    Anonymous

    I like std::vector

    • 3 weeks ago
      Anonymous

      >t. prostitutemonger

  23. 3 weeks ago
    Anonymous

    >t. cnile

  24. 3 weeks ago
    Anonymous

    >What type of person do you imagine?
    a IQfy user

  25. 3 weeks ago
    Anonymous

    Some old wise lisp guy

  26. 3 weeks ago
    Anonymous

    based linked list enthusiast

    • 3 weeks ago
      Anonymous

      gem

    • 3 weeks ago
      Anonymous

      saved

  27. 3 weeks ago
    Anonymous

    linear arrays my beloved

  28. 3 weeks ago
    Anonymous

    Human centipede

  29. 3 weeks ago
    Anonymous

    Terry
    god there are so many linked lists in TempleOS you wouldn't believe

  30. 3 weeks ago
    Anonymous

    Linked lists are bad at everything. There's literally never any reason to use them over an array.

  31. 3 weeks ago
    Anonymous

    a simpleton, you could make it at least circular

  32. 3 weeks ago
    Anonymous

    must say the concept reminds me of the blockchain. Or the other way round perhaps, blockchains remind me of linked lists.

    • 3 weeks ago
      Anonymous

      >must say the concept reminds me of the blockchain. Or the other way round perhaps, blockchains remind me of linked lists.
      Lunked lists are the essential data structure you learn in any basic computer class in University. The second half of the first lesson on C in uni (that's 20+ years ago) was implementing a linked. So Blockchain is a linked list with cryptographic hashes between a node and all the previous nodes and this way anyone can independently verify that a Blockchain hasn't been modified.

      If you want to get more technical linked lists are by definition acyclic (there are no loops) and they have a direction (there is a head and a detailed) so they are a directed acyclic graph or DAG. Other common DAGs are trees - there is a single root node and any node can have one or more children except the leaf nodes that have none. Git is implemented with a DAG and this explains a lot of git behaviours.Git has hashes to allow anyone to verify a git tree hasn't been manipulated (this is why you rebase when you modify an internal node) and often you will hear that git is a blockchain. The tree like data structure with cryptographic hashes is called a merkle tree. Blockchains are a kind of merkle tree. The unique aspects of Blockchains are the decentralization of the implementation and the use of the storage space of the tree as either a distributed ledger or as a distributed memory for smart contract applications.

      Data structures are cool, read about them and implement some in C.

  33. 3 weeks ago
    Anonymous

    >having a favorite data stricture
    >he doesn't know

Your email address will not be published. Required fields are marked *