Data Structure & Algorithms
  • 🖌️Unlocking the Power of Algorithms with C#
  • Data Structure
    • Data Structure
    • Big O
    • Array
    • Linked Lists
    • Stacks
    • Queues
    • Hash Tables
    • Trees
    • Graphs
    • Heap Sort
    • ParkingLot Algorithm
    • LRU cache
    • Priority Queue
  • Algorithms
    • Algorithm
    • Recursion
    • Sorting
    • Searching
    • Dynamic Programming
  • Problems
    • Array
      • Two Sum
      • Two Sum II - Input Array Is Sorted
      • Contains Duplicate
      • Maximum Subarray
      • House Robber
      • Move Zeroes
      • Rotate Array
      • Plus One
      • Find number of subarrays with even length
      • Find number of subarrays with even sum
      • Find Missing Element
      • Reduce Array Size to The Half
      • Remove Duplicates
      • Merge Sorted Arrays
      • Arrays Intersection
      • 3Sum
      • Trapping Rain Water
      • Maximum sum of a subarray
      • Longest Subarray
      • Subarray Sum Equals K
      • Container With Most Water
      • Missing Number
      • Roman to Integer
      • First Missing Positive
      • Unique Integers That Sum Up To 0
      • Integer to Roman
      • Flatten
    • String
      • Check if two strings are permutation of each other
      • String Compression
      • Palindrome Permutation
      • Determine if a string has all Unique Characters
      • One Away
      • Longest Substring Without Repeating Characters
      • Valid Palindrome
      • Valid Palindrome II
      • Backspace String Compare
      • First Unique Character in a String
      • Is Subsequence
      • URLify a given string
      • String has same characters at same position
      • Number of Ways to Split a String
      • Check whether two Strings are anagram of each other
      • Print last `n` lines of a big file or big string.
      • Multiply Strings
    • Matrix
      • Search a 2D Matrix
      • Search a 2D Matrix II
      • Rotate Matrix
      • Spiral Matrix
      • Set Matrix Zeroes
    • Bit Manipulation
      • Sum of Two Integers
      • Reverse Number
      • Reverse Number II
      • Binary Bits Count
      • Binary Bits Count II
    • Stack
      • Valid Parentheses
      • Balance or not expression
      • Decode String
    • Tree
      • Binary Tree Inorder Traversal
      • Binary Tree Preorder Traversal
      • Binary Tree Postorder Traversal
      • Binary Tree Level Order Traversal
      • Binary Tree Return All Root-To-Leaf Paths
      • Binary Tree Height-Balanced
      • Valid Binary Search Tree
      • Binary Tree Sum of all left leaves.
    • Linked List
      • Linked List Delete Middle Node
      • Merge Sorted Linked List
      • Reverse Linked List
      • Remove Duplicates from Sorted List
      • Remove Duplicates from Unsorted List
      • Linked List Cycle
    • Graph
      • The Number Of Islands
      • Number of Closed Islands
      • Max Area of Island
      • Rotting Oranges
      • Number of Provinces
      • Course Schedule
      • Surrounded Regions
      • Snakes and Ladders
      • Widest Path Without Trees
      • Knight Probability in Chessboard
      • Possible moves of knight
      • Check Knight Tour Configuration
      • Steps by Knight
      • Network Delay Time
    • Greedy
      • Best Time to Buy and Sell Stock
      • Best Time to Buy and Sell Stock II
      • Smallest Subset Array
      • Jump Game
    • Backtracking
      • Towers of Hanoi
      • Subsets
      • Combination Sum
      • Sudoku Solver
      • Word Search
    • Heap
      • Kth Largest Element in an Array
      • Top K Frequent Elements
    • Sorting
      • Order Colors String
    • Recursion
      • Number To Text
      • Divide Number
Powered by GitBook
On this page
  • Types of Array Sizes
  • Types of Arrays
  • Operations of the array in data structure
  1. Data Structure

Array

An array is a data structure that stores a fixed-size sequential collection of elements of the same type. The elements are stored in contiguous memory locations, allowing for efficient access and manipulation. The total number of elements in an array is its length.

Types of Array Sizes

There are basically two types of array sizes:

  • Static Array: In this type of array, memory is allocated at compile time having a fixed size of it. We cannot alter or update the size of this array.

  • Dynamic Array: In this type of array, memory is allocated at run time but not having a fixed size. Suppose, a user wants to declare any random size of an array, then we will not use a static array, instead of that a dynamic array is used in hand. It is used to specify the size of it during the run time of any program.

Types of Arrays

There are four types of arrays:

  • One-Dimensional Arrays: A one-dimensional array is a kind of linear array. It involves single sub-scripting. The [] (brackets) is used for the subscript of the array and to declare and access the elements from the array.

  • Two-Dimensional Arrays: An array involving two subscripts [] [] is known as a two-dimensional array. They are also known as the array of the array. Two-dimensional arrays are divided into rows and columns and are able to handle the data of the table.

  • Multi-dimensional Arrays: A multi-dimensional array is an array with more than two dimensions. It can be thought of as an array of arrays of arrays, and so on.

  • Jagged array: A jagged array is an array of arrays, where each sub-array can have a different number of elements.

Example

// Array example
var simple_array = [1, 2, 3, 4, 5]; 
// Jagged Array
var jagged_array = [[1, 2, 3], [4, 5], [6, 7, 8, 9]];
//Two Dimensinal Array ( 2 Rows,3 Columns)
var two_dimensinal = new int[2,3]
                    {
                        {2, 5, 9},
                        {6, 9, 15}
                    };

Operations of the array in data structure

There are some operations of the array in the data structure:

  • Access: It get an element at a particular index.

  • Insertion: It is used to add an element at a particular index.

  • Deletion: It is used to delete an element from a particular index.

  • Search: It is used to search an element using the given index or by the value.

  • Update: It updates an element at a particular index.

  • Sort: Arranges elements in a specific order.

Complexity Table

Operation
Best Case
Average Case
Worst Case

Access

O(1)

O(1)

O(1)

Search

O(1)

O(N)

O(N)

Insertion (at the end)

O(1)

O(1)

O(N)

Insertion (at the beginning or middle)

O(1)

O(N)

O(N)

Deletion (from the end)

O(1)

O(1)

O(1)

Deletion (from the beginning or middle)

O(1)

O(N)

O(N)

PreviousBig ONextLinked Lists

Last updated 1 year ago