cleaning up and organizing old problems (builtin)

Author: Mari Wahl

README.md

@@ -35,13 +35,9 @@ src/
 
 └── trees
 
-└── searching_and_sorting
-
-    ├── searching
+└── bitwise
 
-    ├── sorting
-
-└── Extra Interview Problems
+└── searching_and_sorting
 
 └── USEFUL
 

src/EXTRA_INTERVIEW_PROBLEMS/math_arrays_and_strings/rev_string.py

@@ -1,17 +1,17 @@
-#!/usr/bin/python3
-# mari von steinkirch @2013
-# steinkirch at gmail
+#!/usr/bin/env python
+
+__author__ = "bt3"
 
 from collections import OrderedDict
 
 def  OrderedDict_example():
-    ''' show some examples for OrderedDict ''' 
-    ''' keep the order of insertion. 
+    ''' show some examples for OrderedDict '''
+    ''' keep the order of insertion.
         maintains a doubly linked list, so size is more than twice than normal dict'''
-      
+
 
     pairs = [('a', 1), ('b',2), ('c',3)]
-  
+
     d1 = {}
     for key, value in pairs:
         if key not in d1:

src/EXTRA_INTERVIEW_PROBLEMS/advanced/lru_cache.py renamed to src/USEFUL/advanced/lru_cache.py

@@ -1,32 +1,31 @@
-#!/usr/bin/python3
-# mari von steinkirch @2013
-# steinkirch at gmail
+#!/usr/bin/env python
+
+__author__ = "bt3"
 
 from collections import Counter
 
 def  Counter_example():
-    ''' show some examples for Counter ''' 
-    ''' it is a dictionary that maps the items to the number of occurences '''
+    ''' it is a dictionary that maps the items to the number of occurrences '''
     seq1 = [1, 2, 3, 5, 1, 2, 5, 5, 2, 5, 1, 4]
     seq_counts = Counter(seq1)
     print(seq_counts)
-    
+
     ''' we can increment manually or use the update() method '''
     seq2 = [1, 2, 3]
     seq_counts.update(seq2)
     print(seq_counts)
-    
+
     seq3 = [1, 4, 3]
     for key in seq3:
         seq_counts[key] += 1
     print(seq_counts)
-        
+
     ''' also, we can use set operations such as a-b or a+b '''
     seq_counts_2 = Counter(seq3)
-    print(seq_counts_2)  
-    print(seq_counts + seq_counts_2)  
+    print(seq_counts_2)
+    print(seq_counts + seq_counts_2)
     print(seq_counts - seq_counts_2)
-    
+
 if __name__ == '__main__':
     Counter_example()
 

src/builtin_structures/dicts/OrderedDict_example.py renamed to src/USEFUL/basic_examples/example_OrderedDict.py

@@ -1,13 +1,13 @@
-#!/usr/bin/python3
-# mari von steinkirch @2013
-# steinkirch at gmail
+#!/usr/bin/env python
+
+__author__ = "bt3"
 
 from collections import defaultdict
 
 def  defaultdict_example():
-    ''' show some examples for defaultdicts ''' 
-    pairs = {('a', 1), ('b',2), ('c',3)}   
-    
+    ''' show some examples for defaultdicts '''
+    pairs = {('a', 1), ('b',2), ('c',3)}
+
     d1 = {}
     for key, value in pairs:
         if key not in d1:

src/builtin_structures/dicts/Counter_example.py renamed to src/USEFUL/basic_examples/example_counter.py

@@ -1,6 +1,6 @@
-#!/usr/bin/python3
-# mari von steinkirch @2013
-# steinkirch at gmail
+#!/usr/bin/env python
+
+__author__ = "bt3"
 
 
 def usual_dict(dict_data):
@@ -28,7 +28,7 @@ def test_setdef(module_name='this module'):
                ('key2', 'value5'),)
     print(usual_dict(dict_data))
     print(setdefault_dict(dict_data))
-        
+
     s = 'Tests in {name} have {con}!'
     print(s.format(name=module_name, con='passed'))