A collection of my smaller Python algorithms in the style of mini-Python challenges.
A python implementation of a linear search algorithm, where items are individually compared against an item being searched for.
For example, if you were searching for David in a list of names [James, Michael, Robert, John, David, William] the algorithm would iterate through the list and compare each item with the item to be found & would return True when David is found.
Project 1 • Difficulty ★☆☆☆☆ • View Source Code
A python implementation of a bubble sort algorithm, that works by repeatedly swapping adjacent items if they are in the wrong order, over the course of a series of passes.
For example, if you had a list of numbers ranging from 9 to 1 [9, 8, 7, 6, 5, 4, 3, 2, 1] the algorithm would iterate through the list and compare adjacent numbers, switching them if they are the wrong way round. Multiple passes are completed to ensure that the list is sorted, only stopping once no swaps were made in a pass or the maximum number of passes for that set of data is reached.
Project 2 • Difficulty ★★☆☆☆ • View Source Code
A simple run length encoding compression algorithm, which takes a string entered by the user and compresses it by replacing consecutive occurrences of a value with a count of how many times that value occurs consecutively and the value itself.
For example, if 'AAAAAAFFDDDDDCCCAEEEEEEEE' were to be entered by the user the algorithm would produce '6A2F5D3C1A8E', with the leading integer in a pair being the count and the following character being the value from the original string.
Enter String: AAAAAAFFDDDDDCCCAEEEEEEEE
6A2F5D3C1A8E
Project 3 • Difficulty ★★☆☆☆ • View Source Code
A simple algorithm to find a target within a large number even if the number is seperated by values not included within the target number.
For example, if the target value was '4567' and the number was '29834790827659846598324509687326459832745982740972195862' the algorithm would return True, since this value contains 4509687 the target value has been found & hence the program returns True.
Project 4 • Difficulty ★★☆☆☆ • View Source Code
A relatively simplistic password strength checker algorithm which takes a password input and provides a score based on its strength alongside any criteria which was not met. The password strength checks include length, case, special characters, numeric characters & a check against a selection of the most commonly used passwords.
For example, if the user were to enter their password as 'Nvidia26' they would receive a strength score of 80/100, as for each criteria which isn't met the strength score is reduced by 20 points, since the only criteria which wasn't met was the inclusion of special characters the password received a score of 100 - 20 = 80.
Please Enter A Strong Password: Nvidia26
Please Re-Enter Your Password: Nvidia26
Your password received an overall strength score of 80/100
This is considered a weak password, the following criteria were not met: Special Characters
Project 5 • Difficulty ★★☆☆☆ • View Source Code