0325 I feel calm
🖼️ Did some work with Gemini
🖥️ Started learning Python
🌻 Implement the Merge Sort Algorithm Workshop
🖥️ Implement the Quicksort Algorithm
def quick_sort(lst):
if len(lst) == 0:
return []
pivot = lst[0]
less = [x for x in lst[1:] if x < pivot]
equal = [x for x in lst[1:] if x == pivot]
greater = [x for x in lst[1:] if x > pivot]
return quick_sort(less) + [pivot] + quick_sort(equal) + quick_sort(greater)
🔗 visualgo
🖥️ Implement the Selection Sort Algorithm
def selection_sort(lst):
for i in range(len(lst)):
min_index = i
for j in range(i+1, len(lst)):
if lst[j] < lst[min_index]:
min_index = j
if min_index != i:
lst[i], lst[min_index] = lst[min_index], lst[i]
return lst
🖥️ Implement the Luhn Algorithm
def verify_card_number(card_number):
card_number = card_number.replace('-', '').replace(' ', '')
reversed_digits = card_number[::-1]
total = 0
for i, digit in enumerate(reversed_digits):
n = int(digit)
if i % 2 == 1:
n *= 2
if n > 9:
n -= 9
total += n
if total % 10 == 0:
return 'VALID!'
else:
return 'INVALID!'
📖 Started reading Wonder
🔗 Time Spent Using Smartphones (2026 Statistics)