1.
./notes/algorithms.md
2.
./notes/arp.md
3.
./notes/asm.md
4.
./notes/basic_preproc.md
5.
./notes/boost_asio.md
6.
./notes/c_codes.md
7.
./notes/classes.md
8.
./notes/cmake.md
9.
./notes/C_notes.md
10.
./notes/compilers.md
11.
./notes/concurrency.md
12.
./notes/cont_struct.md
13.
./notes/cp_codes.md
14.
./notes/cpp_guidelines.md
15.
./notes/cpp.md
16.
./notes/cp_qs_models.md
17.
./notes/cp_qs_reading.md
18.
./notes/cs2200.md
19.
./notes/cs2600.md
20.
./notes/csd.md
21.
./notes/cv_qualifiers.md
22.
./notes/data_structures.md
23.
./notes/data_types.md
24.
./notes/dhcp.md
25.
./notes/dhcpv6.md
26.
./notes/dns.md
27.
./notes/enum_classes.md
28.
./notes/file_descriptors.md
29.
./notes/functions.md
30.
./notes/gdb.md
31.
./notes/got_plt.md
32.
./notes/hacking_basics.md
33.
./notes/icmp.md
34.
./notes/if_else_loops.md
35.
./notes/io.md
36.
./notes/ipv4.md
37.
./notes/ipv6.md
38.
./notes/jpeg.md
39.
./notes/memory.md
40.
./notes/narnia_levels.md
41.
./notes/natas_levels.md
42.
./notes/network_stack.md
43.
./notes/poe.md
44.
./notes/pointers.md
45.
./notes/project_euler.md
46.
./notes/python.md
47.
./notes/references.md
48.
./notes/regex.md
49.
./notes/registers.md
50.
./notes/rust_notes.md
51.
./notes/rvalue_refs.md
52.
./notes/static_variables_and_functions.md
53.
./notes/std_forward.md
54.
./notes/strings_arrays.md
55.
./notes/tcp.md
56.
./notes/templates.md
57.
./notes/traceroute.md
Light
Rust
Coal
Navy
Ayu
Notes
cp_qs_models
line sweep algo
If we have a line sweep problem, we can sort the events by x-coordinate and then process them in order.
This gives us the maximum number of, say, open intervals.