sparse-Fibonacci

witek-formanski · Oct 30, 2023 · 6a5f919 · 6a5f919
1 parent 405d78b
commit 6a5f919
Show file tree

Hide file tree

Showing 2 changed files with 43 additions and 10 deletions.
diff --git a/src/count_sparse_numbers.c b/src/count_sparse_numbers.c
@@ -6,17 +6,42 @@
 nearest power of two (less than n):
 32dec = 100000bin
 
-100000 - jaka potęga dwójki, tyle zer na końcu
+8:
+100000
+100001
+100010
+100100
+100101
+101000
+101001
+101010
+
+5:
+10000
+10001
+10010
+10100
+10101
+
+3:
+1000
+1001
+1010
+
+2:
+100
+101
+
+1:
+10
+
+1:
+1
+
+Fibonacci!
+
+fib(n+2) - 1 = fib(n+1) + ...?
 
-10 0001
-10 0010
-10 0100
-10 1000
-
-1010 01
-1010 10
-
-10010 1
 */
 
 int nearest_lower_pow_of_two(int n) {}

diff --git a/src/count_sparse_numbers_brute.c b/src/count_sparse_numbers_brute.c
@@ -28,5 +28,13 @@ int main() {
 
     printf("%d", count_sparse_numbers_brute(n));
 
+    // surprise - Fibonacci!
+    // for (int i = 0; i < 13; i++) {
+    //     printf("count_sparse(%d) \t- count_sparse(%d) \t= %d\n",
+    //            1 << (i + 1),
+    //            1 << (i),
+    //            count_sparse_numbers_brute(1 << (i + 1)) - count_sparse_numbers_brute(1 << (i)));
+    // }
+
     return 0;
 }