Відео

Thank you, good explanation!

Try this! (1)n is odd, n = -3 * n + 1 (2)n is even, n = -n / 2

thanks helpful person

Thanks man !!!

what is these mode :D

Thank you

That sounds like an awesome job. I've just applied to 7 internships at the Johnson Space Center down in Clear Lake. Wish me luck!

Is there a way to change the colour of the window's title bar?

I loved better comment

thank you my nigga...much respect from greece

Thanks for this intro

Thank you for these videos!

Very useful video bro, thank you!

Thank you bro

The ext naion list: Python/Pylance Intellicode AutoDocString Better Comments TabNine

Better comments is a great suggestion.

Oh wow thx man. I really want this

Thank you 👍

are u in prison?

Can you have Intellicode and Tabnine running at the same time?

Let me ask. Why do you prefer python? Seems like C# is a much better langage

I've been coding for 5 years professionally and never heard of collatz sequence.

wow, you're so young and implementing algorithms like this from scratch

I think the characters are a little basic. do something like this instead. characters = string.ascii_letters + string.digits + string.punctuation

Great - now may be the time to introduce the observer pattern to observe when the button is clicked? But nice anyway :)

thank you! i have an exam tomorrow and this video is quite helpful

Very useful video. Seriously man i hope things go well for ur channel

Good content keep it up G

dont stop making videos about python <3

Living the dream, man! Congrats!

Nice tips! Thanks

Nice

Hey! Congratulations on starting learning python :) A few refactor comments: 1) don't use camelCase in python, please 2) there is no need to use "elif" if you have return in your conditions 3) it's enough to use "aList[mid] == num" instead of "True if aList[mid] == num else False" 4) use "if __name__ == '__main__':" for your testing elements 5) use "_" for variables you won't use (in for loops, basically) My refactor version: from typing import List def binary_search(nums: List[int], target: int) -> bool: nums.sort() mid = len(nums) // 2 if len(nums) == 1: return nums[mid] == target if nums[mid] == target: return True if target > nums[mid]: return binary_search(nums[mid+1:], target) return binary_search(nums[:mid], target) if __name__ == '__main__': import random nums = [random.randint(0, 10) for _ in range(30)] result = binary_search(nums, 5) print(nums) print(result) But "nums[mid] == target" is duplicated, so we can optimaze it more: from typing import List def binary_search(nums: List[int], target: int) -> bool: nums.sort() mid = len(nums) // 2 if nums[mid] == target: return True if len(nums) == 1: return False if target > nums[mid]: return binary_search(nums[mid+1:], target) return binary_search(nums[:mid], target) if __name__ == '__main__': import random nums = [random.randint(0, 10) for _ in range(30)] result = binary_search(nums, 5) print(nums) print(result) Good luck!