You’ll begin by learning what algorithms and data structures are. You will discover two data structures: linked lists and stacks. You will then learn how to calculate the complexity of an algorithm by using Big O Notation.

Welcome!

Implementing a linked list

Inserting a node at the beginning of a linked list

Removing the first node from a linked list

Understanding Big O Notation

Big O Notation: true or false?

Practicing with Big O Notation

Working with stacks

Implementing a Stack with the push method

Implementing the pop method for a stack

Using Python's LifoQueue

Work with Linked Lists and Stacks and Understand Big O notation

This second chapter will teach you the basics of queues, hash tables, trees, and graphs data structures. You will also discover what recursion is.

Working with queues

Implementing a queue for printer tasks

Using Python's SimpleQueue

Hash tables

Correcting bugs in a dictionary

Iterating  over a nested dictionary

Trees and graphs

Correcting bugs in a tree implementation

Building a weighted graph

Understanding Recursion

Fibonacci sequence

Towers of Hanoi

Queues, Hash Tables, Trees,  Graphs, and Recursion

This chapter will focus on searching algorithms, like linear search, binary search, depth first search, and breadth first search. You will also study binary search trees and how to search within them.

Linear Search and Binary Search

Implementing binary search

Binary search using recursion

Binary Search Tree (BST)

Inserting a node into a binary search tree

Finding the minimum node of a BST

Depth First Search (DFS)

Printing book titles in alphabetical order

Using pre-order traversal with Polish notation

Implementing DFS for graphs

Breadth First Search (BFS)

Using breadth first search in binary trees

Finding a graph vertex using BFS

Searching algorithms

This chapter will teach you some sorting algorithms, like bubble sort, selection sort, insertion sort, merge sort, and quicksort.

Bubble Sort

Bubble sort

Mengurutkan angka menggunakan bubble sort

Memperbaiki bug pada algoritma bubble sort

Selection Sort dan Insertion Sort

Mengode selection sort

Insertion sort

Mengurutkan kartu menggunakan insertion sort

Merge sort

Opsi

Benar

Salah

Merge sort: benar atau salah?

Memperbaiki bug pada algoritma merge sort

Quicksort

Mengurutkan angka menggunakan quicksort

Mengimplementasikan algoritma quicksort

Selamat!

Sorting algorithms

Course Glossary

Sebagian besar program komputer dibangun di atas beberapa struktur data dan algoritma. Pelajari apa yang berada di balik sebagian besar interaksi Anda dengan komputer dalam kursus berdurasi empat jam ini! Anda akan mengenal beberapa struktur data yang paling umum: linked list, stack, queue, graph, dan tree. Anda juga akan mengimplementasikan algoritma populer seperti Depth First Search, Breadth First Search, Bubble sort, Merge sort, dan Quicksort.

Video dilengkapi transkrip langsung yang dapat Anda tampilkan dengan mengeklik "Show transcript" di kiri bawah video.
Glosarium kursus dapat ditemukan di sebelah kanan pada bagian sumber daya.
Untuk memperoleh kredit CPE, Anda perlu menyelesaikan kursus dan mencapai skor 70% pada asesmen yang memenuhi syarat. Anda dapat menuju ke asesmen dengan mengeklik pengingat kredit CPE di sebelah kanan.

Introduction to Object-Oriented Programming in Python

Jelajahi struktur data seperti linked list, stack, queue, hash table, graf, serta algoritma pencarian dan pengurutan.

Struktur Data dan Algoritma di Python

Jelajahi struktur data seperti linked list, stack, queue, hash table, dan graph; serta algoritme pencarian dan pengurutan!

Pengembang Python

Python for Software Engineering

Kotak Alat Pemrograman Python

Mengurutkan angka menggunakan quicksort

Struktur Data dan Algoritma di Python

Latihan interaktif praktis