- 37
- 2 089
Mehdi Hatamian
Estonia
Приєднався 28 лис 2021
Welcome to my channel, your ultimate destination for mastering Computer Science and Python Programming! Dive deep into coding, data structures, and algorithmic thinking with tutorials and engaging content. Whether you're a beginner or an experienced in computer science, my goal is to make learning computer science enjoyable and accessible for everyone. This channel is provided for learning computer science through the magic of animation and multimedia. A more dynamic journey of coding, data structures, and algorithmic thinking, presented in visually engaging lectures.
Big O(N): A Very Simple Beginner's Guide on Linear Time Complexity with Python Example!
This video dives into Big O Notation, specifically Big O(N), also known as linear time complexity. We'll use a step-by-step Python example to solidify your understanding of how input size affects execution time. Please feel free to share your thoughts on this video. Introduction to Time Complexity: ua-cam.com/video/EM6dOQ6oAgI/v-deo.html
Переглядів: 62
Відео
Big O(Log N) Time Complexity in Python: All You Need to Know in Just 8 Minutes!
Переглядів 433 місяці тому
In this tutorial, I'll guide you through how the Big O of log n works, step by step. Using a practical example and additional example provided in Python, you'll grasp the intuition behind the Big O of log n. Big O of log n, written as O(logn), describes an algorithm whose running time grows logarithmically with the input size. Algorithms with O(logn) complexity are highly efficient, making th...
Constant Time Complexity with Examples in Python
Переглядів 396 місяців тому
In this lecture, I will guide you through understanding constant time complexity. I'll provide examples in Python to help you fully grasp the concept, preparing you for upcoming courses on time complexity. Please feel free to share your thoughts. Introduction to Time Complexity: ua-cam.com/video/EM6dOQ6oAgI/v-deo.html #python #timecomplexity #bigo #data_structure #algorithm #codingtutorial
Selection Sort in Python - Very Simple and Intuitive with Example
Переглядів 276 місяців тому
You'll grasp the fundamentals of selection sort and its implementation in Python. We break down the process step by step, making sorting very intuitive. Whether you're a beginner or an experienced coder, this tutorial will enhance your sorting skills and boost your confidence in algorithmic thinking. #Python #SelectionSort #CodingTutorial #Algorithm #Sorting #PythonProgramming #sortingalgorithm...
Introduction to Time Complexity and Big Oh - Fully Animated Edition
Переглядів 258 місяців тому
Explore the essentials in just two minutes - it's a quick journey, but the insights last a lifetime! Time complexity is a measure in computer science that estimates the amount of time an algorithm takes to complete as a function of the input size. Big O notation is a mathematical tool used to describe the upper bound or worst-case scenario of an algorithm's time complexity. It simplifies the fu...
Mastering Counting Sort in Python: A Simple Visualized Guide in 5 Minutes!
Переглядів 149 місяців тому
Explore the intricacies of Counting Sort implementation in Python. Counting Sort is a linear-time sorting algorithm that operates by counting the number of occurrences of each unique element in the input data. It then uses this count information to place the elements in their sorted order. This algorithm is particularly efficient for datasets with a limited range of values. Feel free to share y...
Counting Sort: Easy and Quick Visualized Introduction
Переглядів 229 місяців тому
Counting Sort is a linear time sorting algorithm that efficiently sorts a collection of integers by counting the frequency of each distinct element and placing them in order based on their counts. In this video, I will take you step by step through the Counting Sort algorithm, breaking down each phase with clear explanations and visualizations. Whether you're a student or just curious about sor...
Must-Know Fundamentals of Queue Type: Circular, Simple, Doubly Ended, and Priority Queue
Переглядів 99 місяців тому
This lecture provides a visual exploration of various queue types, encompassing the circular queue, simple queue, doubly-ended queue, and priority queue. Your insights on this presentation are welcome and encouraged. Please feel free to share your thoughts.
Radix Sort: Simple and Quick Visualization in 3 Minutes!
Переглядів 289 місяців тому
Discover Radix Sort in just 3 minutes! Our video simplifies the concept with easy explanations and quick visualizations. Radix Sort is a sorting algorithm that processes numbers digit by digit, placing them in buckets based on each digit's value. It's an efficient method for organizing numerical data and is often used in computer science for its simplicity and speed.
Master Bubble Sort in Python - Very Simple Explanations Through Visualization
Переглядів 109 місяців тому
Learn Bubble Sort Algorithm in Python! Dive into an engaging lecture featuring visualizations and an intuitive breakdown of the bubble sort algorithm. Discover how this sorting technique works by comparing adjacent elements and swapping them until the array is sorted. Share Your Thoughts and Insights! I love to hear from my viewers. Leave a comment below and let me know your experience with bub...
Visualization of Tree Essentials: [Node, Edge, Root, Internal Nodes, Leaf Nodes, Depth, Height]
Переглядів 10110 місяців тому
Through this lecture, we'll explore the essential components of trees - nodes, edges, roots, internal nodes, leaf nodes, depth, and height - gaining a comprehensive understanding of their structure and organization. Please feel free to share your thoughts on this video.
How Quick Sort Works! - Absolute Simple Interactive Visualization and Code in Python!
Переглядів 6810 місяців тому
In this lecture, you will grasp the essence of quick sort, step by step, as we witness the algorithm's graceful divide-and-conquer strategy in Python programming language. We'll transform complex concepts into clear and engaging visuals through visualized example and code. Please feel free to share your thoughts about this video, and I would love to hear from you to improve future videos further.
Prim's Algorithm - Absolute Simple Visual Guide Through Every Step in Less Than 4 Minutes!
Переглядів 2810 місяців тому
In this lecture, we will delve into the heart of Prim's algorithm, step by step, witnessing its approach to building minimum spanning trees. Understanding the fundamental principles of Prim's algorithm will equip you with the knowledge and skills to conquer this essential technique. Explore a guided journey by visualizations and practical examples, transforming complex concepts into clear and e...
Master Insertion Sort in Python: Extremely Simple In Less Than 7 Minutes!
Переглядів 6010 місяців тому
In this lecture, we delve into the Insertion Sort through a comprehensive visualization guide in the Python programming language. Whether you're a beginner or an experienced coder, this course is designed to equip you with a deep understanding of Insertion Sort's inner workings. By the end of this course, you'll have a solid grasp of how Insertion Sort efficiently organizes data and how it comp...
Graph Theory: Graph Essentials in Less Than 6 Minutes!
Переглядів 8210 місяців тому
I will take you through learning the basics of graph theory, a powerful data structure that represents the relationship between objects or entities through nodes and edges. A straightforward course to illustrate the types of graphs very quickly, including directed and undirected graphs, weighted graphs, directed acyclic graphs, multi-graph, connected graphs, and completed graphs. In addition, y...
Hash Table Implementation in Python - Extremely Easy in Less Than 8 Minutes!
Переглядів 39310 місяців тому
Hash Table Implementation in Python - Extremely Easy in Less Than 8 Minutes!
Recursive Function in Python - Extremely Simple and Intuitive!
Переглядів 3110 місяців тому
Recursive Function in Python - Extremely Simple and Intuitive!
Linked List Operations By Given Examples! - Simply Visualized Learning
Переглядів 910 місяців тому
Linked List Operations By Given Examples! - Simply Visualized Learning
Array Operations in Python - A Visualized Guide for Absolute Beginners
Переглядів 1711 місяців тому
Array Operations in Python - A Visualized Guide for Absolute Beginners
Linear Search in Python - Step by Step Visualization
Переглядів 33Рік тому
Linear Search in Python - Step by Step Visualization
Introduction to Hash Function: Simply Described by Animation
Переглядів 86Рік тому
Introduction to Hash Function: Simply Described by Animation
Merge Sort Visualization - Combining the Array(Part 2 of 2)
Переглядів 16Рік тому
Merge Sort Visualization - Combining the Array(Part 2 of 2)
Coding of Linked List in Python -Step by Step Visualization
Переглядів 37Рік тому
Coding of Linked List in Python -Step by Step Visualization
Introduction to Hash Table - A Visual Explanation for Beginners
Переглядів 92Рік тому
Introduction to Hash Table - A Visual Explanation for Beginners
Binary Search in Python - Step by Step Visualization
Переглядів 58Рік тому
Binary Search in Python - Step by Step Visualization
Learn Kruskal's Algorithm in 2 Minutes ! - By Animation
Переглядів 189Рік тому
Learn Kruskal's Algorithm in 2 Minutes ! - By Animation
Learn Linked List by Animation in less than 5 Minutes!
Переглядів 50Рік тому
Learn Linked List by Animation in less than 5 Minutes!
Introduction to Recursion by Animation in 4 Minutes!
Переглядів 592 роки тому
Introduction to Recursion by Animation in 4 Minutes!
Merge Sort Visualization - Splitting the Array(Part 1)
Переглядів 472 роки тому
Merge Sort Visualization - Splitting the Array(Part 1)
Introduction to Binary Search in 3 Minutes!
Переглядів 1452 роки тому
Introduction to Binary Search in 3 Minutes!
This is an amazing video, please make more
Thanks for your comment. Stay tuned; I'll be updating shortly
I've a question for you. Let's assume we add two n-digit numbers. Does it take a constant time value, regardless of n? If it is, will this still be a constant when n is a very large number?
Thanks for your comment. Adding two numbers, as in this example, is a classic example of a constant time operation. It doesn't matter if you're adding 1 and 2 or 10000 and 20000, the basic steps involved (retrieving the numbers, performing the addition, storing the result) will always be the same. This is why, in Big O notation, which is used to describe the efficiency of algorithms, such an operation has a complexity of O(1). Therefore, We care about the number of operations needed, not the specific values involved.
@@mehdihatamian Thank you for your time, I look forward to your videos.
Thanks Shalo. Positive comments are what keeps me going. Stay tuned, I'm working on a new series of videos.
Thank you for these videos, Mehdi.