Understanding Sorting Algorithms
By freeCodeCamp.org
Published: Jun 18, 2021“
Learn some of the most popular sorting algorithms! You will learn selection sort, bubble sort, insertion sort, merge sort, and their order of complexities! This video uses C++ but the concepts apply to any programming language.
This course was created by Haris Iftikhar.
- Coding Cleverly YouTube Channel: https://www.youtube.com/codingcleverly
- Coding Cleverly Twitter: https://twitter.com/codingcleverly
- Coding Cleverly Instagram: https://instagram.com/codingcleverly
- Coding Cleverly Facebook: https://www.facebook.com/CodingClever…
Source code on GitHub: https://github.com/codingcleverly/sor…
Course Contents
- (0:00:00) Introduction
- (0:01:06) Simple Sorting Algorithm
- (0:16:16) Selection Sort
- (0:25:56) Diagrammatic Explanation
- (0:28:40) Bubble Sort
- (0:35:20) Graphical Explanation of BubbleSort
- (0:38:51) Insertion Sort
- (0:45:08) Graphical Implementation
- (0:49:30) Merge Sort
- (0:51:57) Extensive Explanation
- (1:09:37) Difference b/w the Algorithms
- (1:10:46) Conclusion
”
Tag: Algorithm
[#Script #Coding] Algorithms in Python – Full Course for Beginners
Algorithms in Python – Full Course for Beginners
By freeCodeCamp.org
Published: Sep 22, 2022“
In this Introduction to Algorithms in Python course, you’ll learn about algorithm basics like recursion and then go all the way to working with concepts like dynamic programming.
The 5 main course segments include simple recursive algorithms, data structures, divide & conquer, greedy algorithms, and dynamic programming.
Joy Brock developed this course in collaboration with realtoughcandy.io. Check out Joy’s channel: https://www.youtube.com/c/PythonLearn…
Sign up for the RealToughCandy newsletter and get a free ebook plus coding challenges, exclusive promo codes and more delivered directly to your inbox. https://realtoughcandy.com/newsletter…
Code Samples
- https://github.com/joyb0218/intro_to_…
- https://github.com/joyb0218/intro_to_…
- https://github.com/joyb0218/intro_to_…
- https://github.com/joyb0218/intro_to_…
- https://github.com/joyb0218/intro_to_…
Course Contents
- (0:00:00) Intro & course overview
- (0:07:07) Factorials refresher
- (0:10:04) CODING CHALLENGE: Factorial program using iteration, recursion
- (0:14:57) What is a permutation?
- (0:16:34) CODING CHALLENGE: Recursive permutation
- (0:20:13) Iterative permutation example
- (0:22:17) 8/N queens problem: theory & explanation
- (0:23:57) Real world example of permutations
- (0:24:49) Lesson recap
- (0:26:11) What are data structures?
- (0:27:53) What is a one-dimensional array?
- (0:29:01) Search & sort
- (0:30:39) CODING CHALLENGE: Linear search
- (0:31:00) Binary search
- (0:32:06) CODING CHALLENGE: Iterative binary search
- (0:33:31) Coding a recursive binary search
- (0:34:47) Bubble sort
- (0:36:42) CODING CHALLENGE: Bubble sort
- (0:38:02) Insertion sort
- (0:39:24) CODING CHALLENGE: Insertion sort
- (0:40:36) Linked lists
- (0:44:01) CODING CHALLENGE: Linked list (traverse, search, add, delete, header, nodes, tail)
- (0:52:12) Hash tables
- (0:56:27) Lesson recap
- (0:57:42) Divide & conquer algorithm paradigm: uses, benefits and more
- (1:00:43) Merge sort
- (1:02:48) CODING CHALLENGE: An efficient merge sort
- (1:05:48) Getting judged mercilessly on LeetCode
- (1:06:47) Getting Python to do the work for us with sorted()
- (1:07:33) Matrix multiplication
- (1:10:06) CODING CHALLENGE: Matrix multiplication
- (1:11:20) Strassen algorithm
- (1:14:45) CODING CHALLENGE: Strassen algorithm
- (1:16:27) Lesson recap
- (1:17:21) What is a greedy algorithm?
- (1:19:20) Assign mice to holes conceptual overview
- (1:21:45) CODING CHALLENGE: Assign mice to holes
- (1:23:10) Fractional knapsack
- (1:23:36) Understanding the fractional knapsack problem with a (light-hearted) dystopian apocalypse example
- (1:25:54) Coding challenge prep
- (1:27:13) CODING CHALLENGE: Fractional knapsack
- (1:31:49) Egyptians fractions
- (1:34:03) CODING CHALLENGE: Egyptian fractions
- (1:37:06) Lesson recap
- (1:38:15) What is dynamic programming (also called DP)?
- (1:41:55) What is the principle of optimality?
- (1:42:20) The 3-step process to solving a problem with optimal substructure
- (1:43:55) Introduction to “ugly numbers”
- (1:47:19) CODING CHALLENGE: Ugly numbers
- (1:51:41) Traveling salesman problem (TSP)
- (1:55:49) CODING CHALLENGE: Traveling salesman problem
- (1:59:52) Palindromic matrix paths
- (2:03:11) CODING CHALLENGE: Palindromic matrix paths
- (2:08:37) Lesson recap
- (2:10:03) Course wrap up (and the importance of coding every day)
[READ MORE]”
[#Script #Coding] Internet History, Technology, and Security – Full Course from Dr. Chuck
Internet History, Technology, and Security – Full Course from Dr. Chuck
By freeCodeCamp.org
Published: Dec 20, 2021“
Learn about the history of the Internet. In this course, you will learn how the Internet was created, who created it, and how it works. Along the way, you will meet many of the innovators who developed the Internet and Web technologies that we use today.
Course website: Dr. Charles Severance developed this course. He is a Clinical Professor at the University of Michigan School of Information, where he teaches various technology-oriented courses including programming, database design, and Web development.
Course Contents
(0:00:00) Introduction (0:09:28) High Stakes Research in Computing and Communication (0:16:50) IEEE Computer: Alan Turing at Bletchley Park (0:41:39) The “First” Electronic Computers Around the World (0:44:30) Monash Museum of Computing History Interviews (0:51:33) Post-War Computing and Communication (1:03:28) Early Academic Networking Research (1:19:04) Len Kleinrock: The First Two Packets on the Internet (1:32:06) Packet Switched Networks (1:37:47) Computing Conversations: Len Kleinrock on the Theory of Packets (1:48:30) Packet Switching and the ARPANET (1:49:50) Katie Hafner on the history of the ARPANET project (2:01:54) Supercomputers as Technology Drivers (2:05:38) Networked Computing, lecture by Larry Smarr on Scientific Computing (2:16:36) From Super Computers to NSFNet (2:19:57) Doug Van Houweling: Building the NSFNet (2:32:13) Expanding NSFNet Around the World (2:34:42) Nii Quaynor: Bringing the Internet to Africa (2:47:28) The World-Wide-Web Emerges at CERN Collider by the cernettes: https://youtu.be/1e1eLe1ihT0 (2:51:28) Building the Web Around the World (3:26:38) Steve Job’s Second-Order Effects (High resolution) (3:39:01) Mosaic at NCSA – The Browser for Everybody (3:43:01) Joseph Hardin: NCSA Mosaic (3:57:12) Reflecting on Mosaic (4:01:22) Computing Conversations with Brendan Eich (4:13:38) Computing Conversations: Mitchell Baker on the Mozilla Foundation (4:32:29) The Web, the World, and the Economy (4:51:05) Computing Conversations: Brian Behlendorf on the Apache Software Foundation (4:55:39) Open Source Wrap Up (4:56:06) Introduction: Link Layer (5:22:11) Computing Conversations: Bob Metcalfe on the First Ethernet LAN (5:39:03) The InterNetwork Protocol (IP) (6:14:35) Computing Conversations: Vint Cerf on the History of Packets (6:30:33) DNS – The Domain Name System (6:38:16) Transport Layer (6:47:45) Van Jacobson: The Slow-Start Algorithm (6:59:32) TCP Wrap Up (7:01:38) Application Layer (7:26:59) Security Introduction (7:29:22) Bruce Schneier: The Security Mindset (7:36:54) Understanding Security (7:46:08) Encryption and Confidentiality (8:06:56) Cryptographic Hashes and Integrity (8:15:47) Bruce Schneier: Building Cryptographic Systems (8:27:06) Hashing and Digital Signatures (8:48:54) Security Public/Private Key – Secure Sockets (9:08:23) Security – Integrity and Certificate Authorities https://ihts.pr4e.com/ ”
[#Script #Coding] Algorithmic Trading Using Python – Full Course
Algorithmic Trading Using Python – Full Course
By freeCodeCamp.org
Published: Dec 04, 2020“
Learn how to perform algorithmic trading using Python in this complete course. Algorithmic trading means using computers to make investment decisions. Computer algorithms can make trades at a speed and frequency that is not possible by a human.
After learning the basics of algorithmic trading, you will learn how to build three algorithmic trading projects.
Code: https://github.com/nickmccullum/algor…
?? Course developed by Nick McCullum. Learn more about Nick here: https://nickmccullum.com/
Course Contents
- (0:00:00) Algorithmic Trading Fundamentals & API Basics
- (0:17:20) Building An Equal-Weight S&P 500 Index Fund
- (1:38:44) Building A Quantitative Momentum Investing Strategy
- (2:54:02) Building A Quantitative Value Investing Strategy
Note that this course is meant for educational purposes only. The data and information presented in this video are not investment advice. One benefit of this course is that you get access to unlimited scrambled test data (rather than live production data), so that you can experiment as much as you want without risking any money or paying any fees.
This course is original content created by freeCodeCamp. This content was created using data and a grant provided by IEX Cloud. You can learn more about IEX Cloud here: https://iexcloud.io/
Any opinions or assertions contained herein do not represent the opinions or beliefs of IEX Cloud, its third-party data providers, or any of its affiliates or employees.
”
[#Script #Coding] Greedy Algorithms Tutorial – Solve Coding Challenges
Greedy Algorithms Tutorial – Solve Coding Challenges
By freeCodeCamp.org
Published: Jun 27, 2022“
Learn how to use greedy algorithms to solve coding challenges. Many tech companies want people to solve coding challenges during interviews and many of the challenges can be solved using a greedy algorithm. A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.
Course from Tanishq Chaudhary. Check out his channel: https://www.youtube.com/c/TanishqChau…
Links to coding challenges on InterviewBit:
- Highest product: https://www.interviewbit.com/problems…
- Bulbs: https://www.interviewbit.com/problems…
- Disjoint intervals: https://www.interviewbit.com/problems…
- Largest permutation: https://www.interviewbit.com/problems…
- Meeting rooms: https://www.interviewbit.com/problems…
- Distribute candy: https://www.interviewbit.com/problems…
- Seats: https://www.interviewbit.com/problems…
- Assign mice to holes: https://www.interviewbit.com/problems…
- Majority element: https://www.interviewbit.com/problems…
- Gas station: https://www.interviewbit.com/problems…
Course contents
- (0:00:00) Greedy introduction
- (0:04:32) Bulbs
- (0:12:11) Highest product
- (0:17:08) Disjoint intervals
- (0:28:43) Largest permutation
- (0:38:30) Meeting rooms
- (0:49:25) Distribute candy
- (1:03:13) Seats
- (1:19:13) Assign mice to holes
- (1:24:19) Majority element
- (1:35:28) Gas station
- (1:52:39) End
”
[#Photoshop #Tutorial] Hidden Algorithms for Easy Color Correction in Photoshop
Hidden Algorithms for Easy Color Correction in Photoshop
By Photoshop Training Channel
Published: Sep 23, 2021“
Discover the hidden algorithm to easily color correct or color match in Photoshop!
I hope you enjoy this information-packed Photoshop tutorial!
SUBSCRIBE to get more amazing Photoshop tutorials!
”
[#Script #Coding] Data Structures and Algorithms in Python – Full Course for Beginners
Data Structures and Algorithms in Python – Full Course for Beginners
By freeCodeCamp.org
Published: Sep 08, 2021“
A beginner-friendly introduction to common data structures (linked lists, stacks, queues, graphs) and algorithms (search, sorting, recursion, dynamic programming) in Python. This course will help you prepare for coding interviews and assessments.
• Course website: https://jovian.ai/learn/data-structures-and-algorithms-in-python
• Created by Aakash N S, founder and CEO of Jovian.”
