You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: assignment-2022-1/README.md
+2-2
Original file line number
Diff line number
Diff line change
@@ -5,9 +5,9 @@
5
5
In this project we are trying to effectively compress a list of non-decreasing integers by using Elias-Fano encoding. This type of compression uses a sussinct data-structure which means that the encoding space requirement is very close to the theoretical lower bound.<br><br>
6
6
The analytical implementation of this algorithm is described [here](https://github.com/Philippos01/Algorithms-Data-Structures/blob/main/assignment-2022-1/assignment-2022-1.pdf)
0 commit comments