Anki Deck Changes

Commit: eb12343b - add space complexity cards

Author: obrhubr <obrhubr@gmail.com>

Date: 2026-01-25T18:01:11+01:00

Changes: 4 note(s) changed (3 added, 1 modified, 0 deleted)

Note 1: ETH::1. Semester::A&D

Deck: ETH::1. Semester::A&D
Note Type: Horvath Classic
GUID: Cnkg?3]K
added

Previous

Note did not exist

New Note

Front

ETH::1._Semester::A&D::04._Sorting_Algorithms::6._Quicksort
Quicksort space complexity?

Back

ETH::1._Semester::A&D::04._Sorting_Algorithms::6._Quicksort
Quicksort space complexity?
\(O(n)\)
Field-by-field Comparison
Field Before After
Front Quicksort space complexity?
Back \(O(n)\)
Tags: ETH::1._Semester::A&D::04._Sorting_Algorithms::6._Quicksort

Note 2: ETH::1. Semester::A&D

Deck: ETH::1. Semester::A&D
Note Type: Horvath Classic
GUID: OeCuLqI!|5
added

Previous

Note did not exist

New Note

Front

ETH::1._Semester::A&D::04._Sorting_Algorithms::7._Heapsort
Extra memory requirements of Heapsort?

Back

ETH::1._Semester::A&D::04._Sorting_Algorithms::7._Heapsort
Extra memory requirements of Heapsort?
\(O(1)\) as we simply arrange the array into a heap.
Field-by-field Comparison
Field Before After
Front Extra memory requirements of Heapsort?
Back \(O(1)\)&nbsp;as we simply arrange the array into a heap.
Tags: ETH::1._Semester::A&D::04._Sorting_Algorithms::7._Heapsort

Note 3: ETH::1. Semester::A&D

Deck: ETH::1. Semester::A&D
Note Type: Horvath Classic
GUID: kXVME,u35.
added

Previous

Note did not exist

New Note

Front

ETH::1._Semester::A&D::04._Sorting_Algorithms::4._Merge_Sort
Merge Sort space Complexity?

Back

ETH::1._Semester::A&D::04._Sorting_Algorithms::4._Merge_Sort
Merge Sort space Complexity?
\(O(n)\)
Field-by-field Comparison
Field Before After
Front Merge Sort space Complexity?
Back \(O(n)\)
Tags: ETH::1._Semester::A&D::04._Sorting_Algorithms::4._Merge_Sort

Note 4: ETH::1. Semester::A&D

Deck: ETH::1. Semester::A&D
Note Type: Algorithms
GUID: nb9;e*.#MD
modified

Before

Front

Back

ETH::1._Semester::A&D::04._Sorting_Algorithms::7._Heapsort
Runtime of Heapsort?


After

Front

Back

ETH::1._Semester::A&D::04._Sorting_Algorithms::7._Heapsort
Runtime of Heapsort?


Field-by-field Comparison
Field Before After
Attributes Not In-Place (it uses a heap)<br>Not Stable Is in place, we re-organise the array into a heap.<br>Not Stable
Tags: ETH::1._Semester::A&D::04._Sorting_Algorithms::7._Heapsort
↑ Top