We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent e51d04b commit 72b57b0Copy full SHA for 72b57b0
1 file changed
source_code/intersection_trees/README.md
@@ -0,0 +1,16 @@
1
+# Intersection trees
2
+
3
+This project illustrates that implementation details, but mostly algorithmic
4
+choices, can have an impact on performance when performing intersection queries
5
+on intervals.
6
7
8
+## What is it?
9
10
+1. `intersection_trees.ipynb`: Jupyter notebook illustrating the different
11
+ implementations and their performance.
12
+1. `naive_pythonic_intersectionic_queries.py`: brute force implementaion that
13
+ uses sets and named tuples.
14
+1. `naive_intersectionic_queries.py`: brute force implementaion that
15
+ uses lists and tuples.
16
+1. `interval_tree.py`: implementation of an interval tree.
0 commit comments