Algorithms and Data Structures Overview

Algorithms and Data Structures Overview

0%

1. Introduction to ADS

When we start learning something new, it is very important to get familiar with the subject of our study first. So let's dive deeper into what we will learn about in this course.

Why Do We Need Algorithms and Data Structures

Why Do We Need Data Structures?

Algorithm Analysis

Challenge: How to Determine Algorithm Complexity

2. List and Array

Arrays and lists serve as foundational data structures in programming, with Python employing them extensively. This section provides an overview of these structures, delving into their concepts and highlighting their implementation nuances within the Python programming language.

Array Data Structure

Basic Array Operations Time Complexity

Challenge: Inserting Elements into the Array

Linked List Data Structure

Basic List Operations Time Complexity

Challenge: Inversing the Order of Elements in the List

Doubly Linked List

3. Advanced Data Structures

There are many applied tasks in which it is necessary to operate with large amounts of structured data and simple data structures such as an array or a linked list may no longer be enough for these purposes. In this section, we'll look at the concept of an abstract data type and how different ADTs allow us to efficiently manage large amounts of data.

Challenge: Using Stack to Find Palindrome

Challenge: Creating Hash Table with String Keys

4. Graphs

In the real world, one often has to deal with tasks in which it is necessary to model complex dependencies between various nodes of a system or domain. Graphs can help us with this. In this section, we will learn what a graph is and how to represent it in computer memory efficiently.

Graph Implementation

Challenge: Graph Traversal Algorithms

Challenge: Balanced Trees

Course Content

Algorithms and Data Structures Overview

Linked List Data Structure

A linked list is a data structure consisting of a sequence of elements called nodes, where each node contains data and a reference to the next node in the sequence.
Unlike arrays, linked lists do not have a fixed size in memory and do not store elements in contiguous memory locations. Instead, they use pointers to connect nodes, allowing for dynamic memory allocation and efficient insertion and deletion of elements.

The next section of the code illustrates this concept.

Linked list vs Array

Linked list implementation


              12345678910111213141516171819
            
from lolviz import *
from IPython.display import display_png

class Node:

  def __init__(self, data):
    self.value = data
    self.next = None

# Let's create some nodes
node1 = Node(1)
node2 = Node(2)
node3 = Node(3)

# Then let's couple them into a linked list
node1.next = node2
node2.next = node3

display_png(objviz(node1))

Note
Pay attention that the built-in list Python structure is not a list conceptually - the list structure is implemented as a dynamic array that can hold elements of various data types. It is similar to an array but with additional functionalities and optimizations.

In contrast to an array where we have direct access to any item, in the linked list, we have direct access only to the first item, and we can access any other item only by the chain of references.

Everything was clear?

Thanks for your feedback!

Section 2. Chapter 4

some-alt