Skip to content

Difference between List and Array in Python

Difference Between one-dimensional and two-dimensional array

Last Updated : 02 Nov, 2023

Array is a data structure that is used to store variables that are of similar data types at contiguous locations. The main advantage of the array is random access and cache friendliness. There are mainly three types of the array:

One Dimensional Array:

It is a list of the variable of similar data types.
It allows random access and all the elements can be accessed with the help of their index.
The size of the array is fixed.
For a dynamically sized array, vector can be used in C++.
Representation of 1D array:

Two Dimensional Array:

It is a list of lists of the variable of the same data type.
It also allows random access and all the elements can be accessed with the help of their index.
It can also be seen as a collection of 1D arrays. It is also known as the Matrix.
Its dimension can be increased from 2 to 3 and 4 so on.
They all are referred to as a multi-dimension array.
The most common multidimensional array is a 2D array.
Representation of 2 D array:

Difference Table:

Basis	One Dimension Array	Two Dimension Array
Definition	Store a single list of the element of a similar data type.	Store a ‘list of lists’ of the element of a similar data type.
Representation	Represent multiple data items as a list.	Represent multiple data items as a table consisting of rows and columns.
Declaration	The declaration varies for different programming language: For C++, datatype variable_name[row] For Java, datatype [] variable_name= new datatype[row]	The declaration varies for different programming language: For C++, datatype variable_name[row][column] For Java, datatype [][] variable_name= new datatype[row][column]
Dimension	One	Two
Size(bytes)	size of(datatype of the variable of the array) * size of the array	size of(datatype of the variable of the array)* the number of rows* the number of columns.
Address calculation.	Address of a[index] is equal to (base Address+ Size of each element of array * index).	Address of a[i][j] can be calculated in two ways row-major and column-major Column Major: Base Address + Size of each element (number of rows(j-lower bound of the column)+(i-lower bound of the rows)) Row Major: Base Address + Size of each element (number of columns(i-lower bound of the row)+(j-lower bound of the column))
Example	int arr[5]; //an array with one row and five columns will be created. {a , b , c , d , e}	int arr[2][5]; //an array with two rows and five columns will be created. a b c d e f g h i j

Applications of Arrays:

2D Arrays are used to implement matrices.
Arrays can be used to implement various data structures like a heap, stack, queue, etc.
They allow random access.
They are cache-friendly.

Difference between List and Array in Python

C

CoderSaty

Improve

Article Tags :

Practice Tags :

Arrays

Similar Reads

Difference between Array and Union in C

1. Array in C : An array is collection of similar data items accessed by a common name stored at continuous memory locations. The elements of an array can be accessed using indices. They can be used to store primitive data types such as int, float, double, char, etc. but all elements have to be of t

Difference between List and Array in Python

In Python, lists and arrays are the data structures that are used to store multiple items. They both support the indexing of elements to access them, slicing, and iterating over the elements. In this article, we will see the difference between the two. Operations Difference in Lists and ArraysAccess

What is the difference between lists and arrays?

In programming, lists and arrays are data structures used to organize and store data. Both have their unique features and purposes. Lists are dynamic and flexible, allowing for easy resizing during runtime, while arrays are static with a fixed size. This difference impacts memory usage and performan

Difference between Array and String in Java

An array is a collection of similar type of elements that are stored in a contiguous memory location. Arrays can contain primitives(int, char, etc) as well as object(non-primitives) references of a class depending upon the definition of the array. In the case of primitive data type, the actual value

Difference between Heaps and Sorted Array

1. Heap:A heap is a tree based data structure in which tree should be almost complete. It is of two types i.e. max and min heap. Max heap: In max heap, if p is the parent and c is its child, then for every parent p the value of it is greater than or equal to the value of cMin heap In min heap, if p

Difference between Array and Map

Array:An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together. This makes it easier to calculate the position of each element by simply adding an offset to a base value, i.e., the memory location of the first element of t

Difference between pointer to an array and array of pointers

Pointer to an array: Pointer to an array is also known as array pointer. We are using the pointer to access the components of the array. int a[3] = {3, 4, 5 }; int *ptr = a; We have a pointer ptr that focuses to the 0th component of the array. We can likewise declare a pointer that can point to whol

Difference Between JavaScript Arrays and Objects

Below are the main differences between a JavaScript Array and Object. FeatureJavaScript ArraysJavaScript ObjectsIndex TypeNumeric indexes (0, 1, 2, ...)Named keys (strings or symbols)OrderOrdered collectionUnordered collectionUse CaseStoring lists, sequences, ordered dataStoring data with key-value

Difference between Stack and Array

Stack: A stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. A stack follows the LIFO (Last In First Out) principle, i.e., the element inserted at the last is the first element to come out. The insertion of an element into a

Difference between Array, Queue and Stack

Array: An Array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together. This makes it easier to calculate the position of each element by simply adding an offset to a base value, i.e., the memory location of the first element of