Malik Abo Shabab MalikAbuShabab

## Binary_serarch.py
"""
Suppose you give the following list of 8 items which is
in ascending order and we want to search for the value 25
"""

matrix = [0,11,16,18,25,29,32,35] # Create matrix


def binary_search(m,  matrix):
    first =1 # Determine the starting first value

## clean_code.md

      
              1 file
            
          
              1425 forks
            
          
                195 comments
              
            
              7238 stars
            
          
                wojteklu
                / clean_code.md
            
            
              Last active
              December 12, 2025 01:36
            
              
                Summary of 'Clean code' by Robert C. Martin
              
          
    Code is clean if it can be understood easily – by everyone on the team. Clean code can be read and enhanced by a developer other than its original author. With understandability comes readability, changeability, extensibility and maintainability.

General rules


Follow standard conventions.
Keep it simple stupid. Simpler is always better. Reduce complexity as much as possible.
Boy scout rule. Leave the campground cleaner than you found it.
Always find root cause. Always look for the root cause of a problem.

Design rules


## gist:7360908

      
              1 file
            
          
              4047 forks
            
          
                1241 comments
              
            
              18622 stars
            
          
                rxaviers
                / gist:7360908
            
            
              Last active
              December 13, 2025 21:53
            
              
                Complete list of github markdown emoji markup
              
          
    People


 :bowtie:
😄 :smile:
😆 :laughing:


😊 :blush:
😃 :smiley:
☺️ :relaxed:


😏 :smirk:
😍 :heart_eyes:
😘 :kissing_heart:


😚 :kissing_closed_eyes:
😳 :flushed:
😌 :relieved:


😆 :satisfied:
😁 :grin:
😉 :wink:


😜 :stuck_out_tongue_winking_eye:
😝 :stuck_out_tongue_closed_eyes:
😀 :grinning:


😗 :kissing:
😙 :kissing_smiling_eyes:
😛 :stuck_out_tongue:
	"""
	Suppose you give the following list of 8 items which is
	in ascending order and we want to search for the value 25
	"""

	matrix = [0,11,16,18,25,29,32,35] # Create matrix


	def binary_search(m, matrix):
	first =1 # Determine the starting first value
`:bowtie:`	😄 `:smile:`	😆 `:laughing:`
😊 `:blush:`	😃 `:smiley:`	☺️ `:relaxed:`
😏 `:smirk:`	😍 `:heart_eyes:`	😘 `:kissing_heart:`
😚 `:kissing_closed_eyes:`	😳 `:flushed:`	😌 `:relieved:`
😆 `:satisfied:`	😁 `:grin:`	😉 `:wink:`
😜 `:stuck_out_tongue_winking_eye:`	😝 `:stuck_out_tongue_closed_eyes:`	😀 `:grinning:`
😗 `:kissing:`	😙 `:kissing_smiling_eyes:`	😛 `:stuck_out_tongue:`