blog.bjrn.se: Lexicographic permutations using Algorithm L (STL next_permutation in Python)
http://blog.bjrn.se/2008/04/lexicographic-permutations-using.html?m=1
http://blog.bjrn.se/2008/04/lexicographic-permutations-using.html?m=1
blog.bjrn.se
Lexicographic permutations using Algorithm L (STL next_permutation in Python)
One of the more useful functions in the C++ Standard Library is next_permutation in <algorithm>. The STL function has a desirable property t...
چهارجلد کتابه از اینجا میتونید دانلود کنید.
بنظرم اینجور کتابها خیلی برای آدم مفیده از روش‌های اساسی حل مسئله و تحلیل الگوریتم ها هرچی بدونیم کمه
https://libgen.is/search.php?req=The+Art+of+Computer+Programming&lg_topic=libgen&open=0&view=simple&res=25&phrase=1&column=def
بنظرم اینجور کتابها خیلی برای آدم مفیده از روش‌های اساسی حل مسئله و تحلیل الگوریتم ها هرچی بدونیم کمه
https://libgen.is/search.php?req=The+Art+of+Computer+Programming&lg_topic=libgen&open=0&view=simple&res=25&phrase=1&column=def
libgen.is
Library Genesis
Library Genesis is a scientific community targeting collection of books on natural science disciplines and engineering.
Python Project – How to Build Tony Stark's JARVIS with Python
https://www.freecodecamp.org/news/python-project-how-to-build-your-own-jarvis-using-python/
https://www.freecodecamp.org/news/python-project-how-to-build-your-own-jarvis-using-python/
freeCodeCamp.org
Python Project – How to Build Tony Stark's JARVIS with Python
Do you remember J.A.R.V.I.S., Tony Stark's virtual personal assistant? If you've seen any of the Ironman or Avengers movies, I'm sure you do. Have you ever wondered whether you could create your own personal assistant? Yes? Tony Stark can help us wit...
A Complete 26 Week Course to Learn Python for Data Science in 2022 | by Frank Andrade | Dec, 2021 | Towards Data Science
https://towardsdatascience.com/a-complete-26-week-course-to-learn-python-for-data-science-in-2022-e95b67551df4
https://towardsdatascience.com/a-complete-26-week-course-to-learn-python-for-data-science-in-2022-e95b67551df4
Medium
A Complete 26 Week Course to Learn Python for Data Science in 2022
Learn most of the Python stuff you need for data science in 26 weeks
Top 25 websites for coding challenge and competition [Updated for 2021] | By Benedict Neo | Towards Data Science
https://towardsdatascience.com/top-20-websites-for-coding-challenge-and-competition-in-2020-f667089a5b47
https://towardsdatascience.com/top-20-websites-for-coding-challenge-and-competition-in-2020-f667089a5b47
Medium
Top 25 websites for coding challenge and competition [Updated for 2021]
Here is my list of the best websites for coding challenges and competitions to practice coding.
7 Best Coding Challenge Websites in 2020 - GeeksforGeeks
https://www.geeksforgeeks.org/7-best-coding-challenge-websites-in-2020/
https://www.geeksforgeeks.org/7-best-coding-challenge-websites-in-2020/
GeeksforGeeks
7 Best Coding Challenge Websites in 2020 - GeeksforGeeks
A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.
10 Exciting Python GUI Projects & Topics For Beginners [2021] | upGrad blog
https://www.upgrad.com/blog/python-gui-projects-project-ideas-for-beginners/
https://www.upgrad.com/blog/python-gui-projects-project-ideas-for-beginners/
upGrad blog
25+ Python GUI Projects to Up Your Programming Skills
Learn everything about Python GUI projects with this comprehensive guide. Master Tkinter, enhance functionality and create dynamic, user-friendly applications.
ترفندهای برنامه‌نویسی
blog.bjrn.se: Lexicographic permutations using Algorithm L (STL next_permutation in Python) http://blog.bjrn.se/2008/04/lexicographic-permutations-using.html?m=1
def next_promutation(li: list) -> list:
"""returns next promutation of a given list"""
j = -2
while True:
if li[j+1] < li[j]:
j -= 1
if j == 0:
break
else:
break
lii, liii = li[:j+1], li[j+1:]
m = -1
while True:
if liii[m] < lii[-1]:
m -= 1
else:
lii[-1], liii[m] = liii[m], lii[-1]
break
liii = sorted(liii)
return lii + liii
"""returns next promutation of a given list"""
j = -2
while True:
if li[j+1] < li[j]:
j -= 1
if j == 0:
break
else:
break
lii, liii = li[:j+1], li[j+1:]
m = -1
while True:
if liii[m] < lii[-1]:
m -= 1
else:
lii[-1], liii[m] = liii[m], lii[-1]
break
liii = sorted(liii)
return lii + liii
Forwarded from کتابخانه مهندسی کامپیوتر و پایتون via @chToolsBot
آموزش طراحی قالب سایت با html-css bootstrap
مدرس: مهدی عباسی
منبع: درسمن
➖➖➖➖
🔅هشتگ ها را در کانال دنبال کنید 👇
#طراحی_سایت #جاوااسکریپت
#html #Css #JavaScript
🆔 @Max_Academy
مدرس: مهدی عباسی
منبع: درسمن
➖➖➖➖
🔅هشتگ ها را در کانال دنبال کنید 👇
#طراحی_سایت #جاوااسکریپت
#html #Css #JavaScript
🆔 @Max_Academy