Complete DSA Series - Chapter: Arrays

Introduction

• Today we will study about arrays.
• Check the playlist available on this channel to study other topics of DSA.

Data Structures and Algorithms

• Data Structure: Structures for storing data in programming.
• Algorithm: The process of performing various operations on data.
• Handling data is essential because all systems are data-based.

What are Arrays?

• The first data structure we will study.
• We use arrays when we need to store multiple data.
• Arrays have a name and store data of the same type.
• Arrays are contiguous and linear.

Creating Arrays

• To create an array, we need to specify the data type and name.
• Example: int marks[5];
• To initialize arrays with values:

  int marks[5] = {99, 100, 54, 36, 88};
  

• Specifying the size of arrays is optional if we provide values during initialization.

Array Indices

• Use indices to access data in arrays, starting from 0.

Operations and Loops with Arrays

• Printing all values of arrays using a loop is simple.
• Use loops for input and output.
• How to find the smallest and largest number in arrays.

Finding the Smallest and Largest Number

• Smallest number:
  • Compare all values and update the smallest.
• Largest number:
  • Compare all values and update the largest.

Search Algorithm

• Linear Search:
  • Compare all values in arrays using a loop.
  • If the value is found, return the index, otherwise return -1.

Reversing Arrays

• Two-Pointer Approach:
  • Swap the first and last values.
  • Use a loop to move forward and backward towards the end.

Summary

• Today we introduced arrays and understood various aspects of them.
• Next chapter: Study of vectors.

Homework

1. Write a function to find the sum and product of all numbers.
2. Swap the maximum and minimum numbers in arrays.
3. Print all unique values in arrays.
4. Print the intersection of two arrays.

---

• Note: Apply this knowledge in the next class.
• Share your progress on Twitter!