Order of growth notes.
parent
6d44e6389b
commit
2430c289dc
|
@ -135,7 +135,7 @@
|
|||
"algorithms/loop-invariants.md": "cbefc346842c21a6cce5c5edce451eb2",
|
||||
"algorithms/loop-invariant.md": "29f9f9090a3109890d333a78acc18b50",
|
||||
"algorithms/running-time.md": "5efc0791097d2c996f931c9046c95f65",
|
||||
"algorithms/order-growth.md": "990e403b9ed0fee5c3775ef7871277e8",
|
||||
"algorithms/order-growth.md": "a4e6620e785f7d677236948182e831cc",
|
||||
"_journal/2024-02-08.md": "19092bdfe378f31e2774f20d6afbfbac",
|
||||
"algorithms/sorting/selection-sort.md": "fcd0dc2ebaabd0a4db1baf7e7ef9f7a9",
|
||||
"algorithms/index 1.md": "6fada1f3d5d3af64687719eb465a5b97",
|
||||
|
@ -222,7 +222,7 @@
|
|||
"filesystems/cas.md": "34906013a2a60fe5ee0e31809b4838aa",
|
||||
"git/objects.md": "b95228a78744d3f9fe173e575aa0445a",
|
||||
"git/index.md": "83d2d95fc549d9e8436946c7bd058d15",
|
||||
"encoding/integer.md": "aa8d28b24028d36892c0be1f14602ddf",
|
||||
"encoding/integer.md": "84b2ce080e0e756f265257e57467f0e6",
|
||||
"_journal/2024-02-29.md": "f610f3caed659c1de3eed5f226cab508",
|
||||
"_journal/2024-02/2024-02-28.md": "7489377c014a2ff3c535d581961b5b82",
|
||||
"_journal/2024-03-01.md": "a532486279190b0c12954966cbf8c3fe",
|
||||
|
@ -236,7 +236,9 @@
|
|||
"_journal/2024-03-03.md": "c4977a3778ed227b768c3f9ad5512670",
|
||||
"_journal/2024-03/2024-03-02.md": "8136792b0ee6e08232e4f60c88d461d2",
|
||||
"_journal/2024-03-04.md": "9ec052061e7a613ff877a4488576e82f",
|
||||
"_journal/2024-03/2024-03-03.md": "64e2f17b4d57a6bd42a3d1b7f2851b83"
|
||||
"_journal/2024-03/2024-03-03.md": "64e2f17b4d57a6bd42a3d1b7f2851b83",
|
||||
"_journal/2024-03-05.md": "e049435d23c401cc28076a4e1edd1c37",
|
||||
"_journal/2024-03/2024-03-04.md": "4948d90a08af2cff58c629c9a2e11ee4"
|
||||
},
|
||||
"fields_dict": {
|
||||
"Basic": [
|
||||
|
|
|
@ -0,0 +1,13 @@
|
|||
---
|
||||
title: "2024-03-05"
|
||||
---
|
||||
|
||||
- [x] Anki Flashcards
|
||||
- [x] KoL
|
||||
- [ ] Sheet Music (10 min.)
|
||||
- [ ] Go (1 Life & Death Problem)
|
||||
- [ ] Korean (Read 1 Story)
|
||||
- [ ] Interview Prep (1 Practice Problem)
|
||||
- [ ] Log Work Hours (Max 3 hours)
|
||||
|
||||
* Start on arithmetic/geometric sequences and their sums.
|
|
@ -460,7 +460,7 @@ END%%
|
|||
|
||||
%%ANKI
|
||||
Basic
|
||||
Using typical identifiers, what is the upper bound of $f(n)$ in $O(g(n))$?
|
||||
Using typical identifiers, what is the lower bound of $f(n)$ in $O(g(n))$?
|
||||
Back: $0$
|
||||
Reference: Thomas H. Cormen et al., *Introduction to Algorithms*, 3rd ed (Cambridge, Mass: MIT Press, 2009).
|
||||
<!--ID: 1709053894080-->
|
||||
|
|
|
@ -1473,7 +1473,7 @@ END%%
|
|||
|
||||
%%ANKI
|
||||
Basic
|
||||
Assuming two's-complement, what is the result of shifting an `int32_t` value by `31`?
|
||||
Assuming two's-complement, what is the result of shifting `int32_t x = 1` left by `31`?
|
||||
Back: $-2^{31}$
|
||||
Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
||||
Tags: c17
|
||||
|
|
Loading…
Reference in New Issue