Array Linked List Stack Queue Sorting Trees - Binary…

• Pros:
  • Very fast to find an item if you know its index (direct access).
  • Data is stored contiguously in memory, which can be efficient.
• Cons:
  • Fixed size: once you create an array, you can't easily change its capacity. If you need more space, you usually have to create a whole new, bigger array and copy everything over.
  • Adding or removing items in the middle can be slow because you might have to shift many other items.

When we talk about searching, we're trying to locate a particular value in a dataset. There are two main approaches you'll encounter:

Photo by Miguel Á. Padriñán on Pexels

Photo by RDNE Stock project on Pexels

Photo by Lukas Blazek on Pexels

You'll often face problems that look complex, and it's not immediately obvious if DP or a greedy approach is best. Let's break down each.

Photo by Mikhail Nilov on Pexels