If you're seeing this message, it means we're having trouble loading external resources on our website.

Хэрэв та вэб шүүлтүүртэй газар байгаа бол домэйн нэрийг *.kastatic.org and *.kasandbox.org блоклосон эсэхийг нягтална уу.

Үндсэн товъёог

Алгоритм хичээлийн удиртгал

Суръя
Алгоритм гэж юу вэ?
(Opens a modal)
Таах олох тоглоом
(Opens a modal)
Замаа хэрхэн олох вэ?
(Opens a modal)
Ярилц: Алгоритм таны амьдралд
(Opens a modal)

Binary search

Суръя
Binary search
(Opens a modal)
Implementing binary search of an array
(Opens a modal)
Challenge: Binary search
(Opens a modal)
Running time of binary search
(Opens a modal)
Дадлага ажил
Running time of binary search
5 асуулт

Asymptotic notation

Суръя
Asymptotic notation
(Opens a modal)
Big-θ (Big-Theta) notation
(Opens a modal)
Functions in asymptotic notation
(Opens a modal)
Big-O notation
(Opens a modal)
Big-Ω (Big-Omega) notation
(Opens a modal)
Дадлага ажил
Comparing function growth
4 асуулт
Asymptotic notation
5 асуулт

Selection sort

Суръя
Sorting
(Opens a modal)
Challenge: implement swap
(Opens a modal)
Selection sort pseudocode
(Opens a modal)
Challenge: Find minimum in subarray
(Opens a modal)
Challenge: implement selection sort
(Opens a modal)
Analysis of selection sort
(Opens a modal)
Project: Selection sort visualizer
(Opens a modal)

Insertion sort

Суръя
Insertion sort
(Opens a modal)
Challenge: implement insert
(Opens a modal)
Insertion sort pseudocode
(Opens a modal)
Challenge: Implement insertion sort
(Opens a modal)
Analysis of insertion sort
(Opens a modal)

Recursive algorithms

Суръя
Recursion
(Opens a modal)
The factorial function
(Opens a modal)
Challenge: Iterative factorial
(Opens a modal)
Recursive factorial
(Opens a modal)
Challenge: Recursive factorial
(Opens a modal)
Properties of recursive algorithms
(Opens a modal)
Using recursion to determine whether a word is a palindrome
(Opens a modal)
Challenge: is a string a palindrome?
(Opens a modal)
Computing powers of a number
(Opens a modal)
Challenge: Recursive powers
(Opens a modal)
The Sierpinski gasket
(Opens a modal)
Project: Recursive art
(Opens a modal)

Ханой хотын цамхагууд

Суръя
Ханой хотын цамхагууд
(Opens a modal)
Towers of Hanoi, continued
(Opens a modal)
Challenge: Solve Hanoi recursively
(Opens a modal)
Дадлага ажил
Move three disks in Towers of Hanoi
3 асуулт

Merge sort

Суръя
Divide and conquer algorithms
(Opens a modal)
Overview of merge sort
(Opens a modal)
Challenge: Implement merge sort
(Opens a modal)
Linear-time merging
(Opens a modal)
Challenge: Implement merge
(Opens a modal)
Analysis of merge sort
(Opens a modal)

Quick sort

Суръя
Overview of quicksort
(Opens a modal)
Challenge: Implement quicksort
(Opens a modal)
Linear-time partitioning
(Opens a modal)
Challenge: Implement partition
(Opens a modal)
Analysis of quicksort
(Opens a modal)

Graph representation

Суръя
Describing graphs
(Opens a modal)
Representing graphs
(Opens a modal)
Challenge: Store a graph
(Opens a modal)
Дадлага ажил
Describing graphs
6 асуулт
Representing graphs
5 асуулт

Breadth-first search

Суръя
Breadth-first search and its uses
(Opens a modal)
The breadth-first search algorithm
(Opens a modal)
Challenge: Implement breadth-first search
(Opens a modal)
Analysis of breadth-first search
(Opens a modal)

Цаашид суралцах судлагдахуун

Суръя
Эндээс хаа хүрэх вэ?
(Opens a modal)

Энэ нэгжийн тухай

Дортмонд коллежийн профессор Том Кормен, Девин Балкком нарын компьютерийн шижлэх ухаан, алгоритмын хичээлүүдийг үзээрэй. Энэ бүлэг хичээлийг үзсэнээр алгоритм ашиглан хайлт хийх, ангилах болон графикийн онол зэргийн тухай дэлгэрэнгүй мэдлэгтэй болно.