Optimized code, faster

If we store in memory len(list) we can run this algorithm too much faster.
kiidbrian · Nov 2, 2017 · 93eab61 · 93eab61
1 parent bf2b096
commit 93eab61
Showing 1 changed file with 3 additions and 1 deletion.
diff --git a/array/circular_counter.py b/array/circular_counter.py
@@ -14,9 +14,11 @@
 def josepheus(int_list, skip):
   skip = skip - 1 #list starts with 0 index
   idx = 0
-  while len(int_list)>0:
+  len_list(len(int_list))
+  while len_list>0:
     idx = (skip+idx)%len(int_list) #hashing to keep changing the index to every 3rd
     print(int_list.pop(idx))
+    len_list -= 1
 
 
 josepheus(a,3)