Scribd
Upload
3 views5 pages

Module 1 - Arrays

The document provides an overview of arrays, defining them as collections of items of the same type stored in contiguous memory locations. It discusses different types of indexing (zero-based, one-based, and n-based) and common array operations such as traversing, insertion, deletion, updates, sorting, and searching. Additionally, it introduces multidimensional arrays and summarizes key concepts learned in the module.

Uploaded by

sushmav725959
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views5 pages

Module 1 - Arrays

The document provides an overview of arrays, defining them as collections of items of the same type stored in contiguous memory locations. It discusses different types of indexing (zero-based, one-based, and n-based) and common array operations such as traversing, insertion, deletion, updates, sorting, and searching. Additionally, it introduces multidimensional arrays and summarizes key concepts learned in the module.

Uploaded by

sushmav725959
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Arrays

Introduction

• An array is a collection of items of the same type i.e. a collection of elements of a


specific data type.
• We can have arrays of different types:
o An array of Integers.
o An array of Floats.
o An array of Booleans.
• At a memory level, arrays are stored in contiguous locations i.e. all the elements are
stored in adjacent memory locations and in order.

Definition of Array

https://www.youtube.com/watch?v=55l-aZ7_F24

Types of Indexing

There are three common ways arrays are indexed:

1. Zero-based Indexing: The index of the array starts from 0. This type of indexing is the
most common type and seen in languages such as Java, C, C++, etc.
2. One-based Indexing: The index of the array starts from 1. This type of indexing is seen
in languages such as R, MATLAB.
3. n-based Indexing: The indices in such languages can start and end at any integer value.
This type of indexing is seen in languages such as Ada.

Some additional reading on why 0 based indices are preferred:


Why we prefer 0 based indexing

Common Array Operations

Some commonly used array operations are:

• Traversing: This is visiting each element in the array in order.


• Insertion: An element can be inserted into the array at a specific index.
• Deletion: An element can be deleted from a specific index in an array.
• Updates: Update the value at a given index.
• Sorting: The array can be reordered based on the values.
• Searching: Find the index of an element given a value.

Searching and Sorting will be covered in a future module.

Traversing

• In the above algorithm, N is the length of the array. Most languages will provide an
interface to get the length of an array. For example, in Java, array.length (length property
of the array class) will give you the length. In python, the len(list) function will give you
the length of the list.
• Note: Python lists are not pure arrays because they allow heterogeneous data types in
them and don't always store elements in contiguous locations

Insertion, Deletion, and Updation

• For Insertion the provided input should be the following:


o Array, the position at which the operation must be performed and the element to
be inserted.
• Note that for a 0-based indexed array, the index at which the insertion must be performed
will be (position - 1).
• Another point to note is for this to work, the array must have an empty space in order to
perform the insert. This is to prevent an issue that commonly occurs in C-like languages
called ArrayIndexOutOfBounds. Read about it
here: https://www.educative.io/edpresso/what-is-the-arrayindexoutofbounds-exception-
in-
java#:~:text=The%20ArrayIndexOutOfBounds%20exception%20is%20thrown,for%20th
is%20error%20during%20compilation.
• Let's look at the algorithm for this. In the algorithm, we make the assumption position N
is empty.

• For deletion, the input could be either of the following:


o Array and the position at which deletion is to be performed.
o Array and the element which is to be deleted.
Let's look at the algorithm for both.
• For updates, the input could be either of the following:
o Array, updated value, and the position at which deletion is to be performed.
o Array, updated value, and the element which is to be deleted.
Let's look at the algorithm for both.

In order to delete or update an element, we need to look at how to search in an array. We will
cover that in a future module. For now, think of "search" as a function you can call in your
update/delete routine.

Multidimensional Arrays

• Multidimensional arrays can be visualized as matrices.


• Let's consider a 2-D array:
https://www.youtube.com/watch?v=36z4qgN3GWw

• Multidimensional arrays support all of the same operations as arrays.


• They are most useful when dealing with matrix-related problems.

Summary - What we learnt and Further Reading

As part of this module:

1. We learned what is an array.


2. Different types of array indexing
3. Common array operations.
4. How to Traverse an array
5. Insert an element, Delete an element and Update an element in an array.
6. What is a multidimensional array?

For advanced topics related to arrays check the below link:

Arrays and Pointers

Multidimensional Pointer Arithmetic

Mapping 2D arrays to Linear memory

You might also like