Beginner Python Concepts

a-Rye

45.5K views

GitHub

Open Source Your Knowledge, Become a Contributor

Technology knowledge has to be shared and made accessible for free. Join the movement.

Create Content

Previous: Data Structures Next: Debugging

Example Algorithms

Here are some example algorithms to see these Python concepts in use.

BUG BOUNTY ------------------------------------------------------------------------------------------

There isn't any monetary reward, BUT I will cite you for the fix here in the playground!

ROT13

ROT13 stands for rotation of 13 values. This means that every character / letter in the plain text will be changed / encrypted to a different character 13 values away. 13 is the classic beginning number for a rotation encryption algorithm due to the nature of being able to decrypt the cipher text simply by encrypting the cipher text again with the same ROT13 algorithm. This is also known as Symmetric Encryption.

Bug In Progress

6-16-22 Apologies, but it seems this code stub has a bug. I am looking into it, but there is a workaround! Copy and paste the code from this one into the other code stub and it functions as expected. You will need to completely overwrite the second code stub's code with this first one. Also, apologies for the messy spacing and this has since been fixed.

Click "Reset Code" to get the original code example back.

END OF BUG BOUNTY ------------------------------------------------------------------------------

Try it out!

def rot13(plain_text):
    alphabet_dict  = {
        'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10
        ,'k':11,'l':12,'m':13,'n':14,'o':15,'p':16,'q':17,'r':18
        ,'s':19,'t':20,'u':21,'v':22,'w':23,'x':24,'y':25,'z':26
    } 
    number_dict  = {
        1:'a',2:'b',3:'c',4:'d',5:'e',6:'f',7:'g',8:'h',9:'i',10:'j'
        ,11:'k',12:'l',13:'m',14:'n',15:'o',16:'p',17:'q',18:'r'
        ,19:'s',20:'t',21:'u',22:'v',23:'w',24:'x',25:'y',26:'z'
    }
    found = False
    cipher_text = ""
    new_index = 0
    capitalized = False
    new_char = ' '
  
    for char in plain_text:
        if char.isupper():
            capitalized = True
        if char.lower() in alphabet_dict:      
            new_index = int(alphabet_dict[char.lower()]) + 13
            found = True
        if new_index > 26:
            new_index %= 26
          
        if capitalized and found:
            cipher_text += number_dict[new_index].upper()
        elif found:
            cipher_text += number_dict[new_index]
        else:
            cipher_text += char
        
        capitalized = False
        found = False
    
    return cipher_text
print(rot13("Uryyb jbeyq!@#$%^&*()_+-=/\\<>?,.~`"))
print(rot13("Hello world!@#$%^&*()_+-=/\\<>?,.~`"))
      

The concept of a circular array is demonstrated with these lines:

if new_index > 26:
    new_index -= 26

So, even if the new index is too large to find the corresponding cipher text character, the index is adjusted to create the illusion of a circular array. A better (and more scalable) way to do this would be to use the modulo operator (%) to ensure any number, no matter how large, would be able to yield a corresponding cipher text character.

if new_index > 26:
    new_index %= 26

Rot N

13 is the most common value, as it allows for Symmetric Encryption. However, it's fairly simple to change this algorithm to accept any value for the rotation. To account for larger values, we need to change the index modification to the modulo style.

Try it out!

def rot_n(plain_text, n):
  alphabet_dict  = {
    'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10
    ,'k':11,'l':12,'m':13,'n':14,'o':15,'p':16,'q':17,'r':18
    ,'s':19,'t':20,'u':21,'v':22,'w':23,'x':24,'y':25,'z':26
  }
  number_dict  = {
    1:'a',2:'b',3:'c',4:'d',5:'e',6:'f',7:'g',8:'h',9:'i',10:'j'
    ,11:'k',12:'l',13:'m',14:'n',15:'o',16:'p',17:'q',18:'r'
    ,19:'s',20:'t',21:'u',22:'v',23:'w',24:'x',25:'y',26:'z'
  }
  cipher_text = ""
  new_index = 0
  capitalized = False
  new_char = ' '
  
  for char in plain_text:
    if char.isupper():
      capitalized = True
    if char.lower() in alphabet_dict:      
      new_index = int(alphabet_dict[char.lower()]) + n
      if new_index > 26:
        new_index %= 26
      if new_index < 1:
        new_index %= 26
        new_index += 26
      if capitalized:
        cipher_text += number_dict[new_index].upper()
      else:
        cipher_text += number_dict[new_index]
    else:
      cipher_text += char
    capitalized = False
    
  return cipher_text
print(rot_n("Uryyb jbeyq!@#$%^&*()_+-=/\\<>?,.~`", 14))
print(rot_n("Ifmmp xpsme!@#$%^&*()_+-=/\\<>?,.~`",-1))
print(rot_n("Hello world!@#$%^&*()_+-=/\\<>?,.~`",12))
print(rot_n("Tqxxa iadxp!@#$%^&*()_+-=/\\<>?,.~`",14))

Generate Character Messages via a Message Dictionary && Calculating a Message Code

Say you want to cut down on the time taken with repetitive messages you want your game characters to say to the player. You could do this by using a dictionary to return a message based on an input value.

Try it out!

msg_dict = {
  1:"Nice weather we're having!", 2:"Careful warrior...", 3:"Welcome to my blacksmith shop!", -1:"Watch it there...", 
  "h_1":"Very spoooooky weather we're having!",
  "c_1":"Very frostie weather we're having!", 
  "v_1":"Very bubbly weather we're having!",
  "eZ":"Hasta la vista, baby"
  "aB":"Groovy!"
}
def show_all_msg():
  for num in msg_dict:
    print(msg_dict[num])
          
show_all_msg()

You can also add the complexity of Holiday Based messages, Region Based messages, and many more!

Try it out!

Open Source Your Knowledge: become a Contributor and help others learn. Create New Content

Open Source Your Knowledge, Become a Contributor

11/13 Example Algorithms

Example Algorithms

BUG BOUNTY ------------------------------------------------------------------------------------------

ROT13

Bug In Progress

Click "Reset Code" to get the original code example back.

END OF BUG BOUNTY ------------------------------------------------------------------------------

Rot N

Generate Character Messages via a Message Dictionary && Calculating a Message Code

Beginner Java Concepts

Python from Zero to Hero

Coding game January

Recueil d'exercices pour apprendre Python au lycée