ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

615,989 results

Gate Smashers
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

In this video, Varun sir will simplify the most important concepts in Algorithm Analysis – Big O, Big Omega (Ω), and Theta (Θ) ...

14:25
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

3,038,743 views

6 years ago

People also watched

Apna College
Time & Space Complexity - DSA Series by Shradha Ma'am

New *DSA Sheet* Link: https://dsa.apnacollege.in/ Lecture 12 of DSA Series : Time & Space Complexity in Detail Share your ...

1:25:41
Time & Space Complexity - DSA Series by Shradha Ma'am

807,412 views

1 year ago

Apna College
Sorting Algorithms | Bubble Sort, Selection Sort & Insertion Sort | DSA Series by Shradha Ma'am

Lecture 24 of DSA Placement Series Company wise DSA Sheet Link : https://docs.google.com/spreadsheets/d ...

34:33
Sorting Algorithms | Bubble Sort, Selection Sort & Insertion Sort | DSA Series by Shradha Ma'am

1,135,412 views

1 year ago

Abdul Bari
1.5.1 Time Complexity #1

Finding Time Complexity of Different kind of snippets PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on ...

9:44
1.5.1 Time Complexity #1

2,965,034 views

7 years ago

Yatish Parmar
Time and space complexity of sorting algorithms

Video comparing: - Bubble sort - Insertion sort - Merge sort - Quicksort in terms of time and space complexity using Big-O.

8:13
Time and space complexity of sorting algorithms

54,257 views

8 years ago

Abdul Bari
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1

Asymptotic Notations #1 Big - Oh Omega Theta PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

15:46
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1

2,338,864 views

7 years ago

Techstark
a* algorithm in artificial intelligence example

a* algorithm in artificial intelligence makes use of a priority queue just like Uniform Cost Search with the element stored being the ...

9:03
a* algorithm in artificial intelligence example

57,280 views

7 years ago

KnowledgeGATE by Sanchit Sir
Complete DAA Design and Analysis of Algorithm in one shot | Semester Exam | Hindi

KnowledgeGate Website: https://www.knowledgegate.ai For free notes on University exam's subjects, please check out our ...

9:23:20
Complete DAA Design and Analysis of Algorithm in one shot | Semester Exam | Hindi

1,323,832 views

2 years ago

Abdul Bari
2.8.1  QuickSort Algorithm

Quick Sort Algorithm Explained PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

13:43
2.8.1 QuickSort Algorithm

3,823,192 views

7 years ago

GeeksforGeeks
Time and Space Complexity explained in literally 5 minutes | Big O | Concepts made simple ep -1

Time and Space Complexity Explained in Literally Minutes! | Concepts Made Simple Ep -1 Confused about time and space ...

5:43
Time and Space Complexity explained in literally 5 minutes | Big O | Concepts made simple ep -1

176,254 views

1 year ago

Abdul Bari
2.6.1 Binary Search Iterative Method

Divide and Conquer Method Binary Search Method Iterative Algorithm Analysis of Binary Search Algorithm PATREON ...

19:36
2.6.1 Binary Search Iterative Method

1,005,534 views

7 years ago

Gate Smashers
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

In this video, Varun sir will break down the basics of what an algorithm is and why it's so important in computer science. You'll also ...

7:51
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

1,577,852 views

6 years ago

Gate Smashers
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA

In this session, Varun sir will introduce you to the world of Design and Analysis of Algorithms (DAA) — a crucial subject for GATE, ...

11:27
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA

3,077,776 views

6 years ago

Gate Smashers
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques

Greedy techniques are one of the most intuitive and powerful problem-solving approaches in algorithms. In this video, Varun sir ...

7:32
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques

1,291,083 views

5 years ago

Gate Smashers
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

In this video, Varun sir will explain how Quick Sort actually works using simple examples you can easily follow. You'll understand ...

13:27
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

3,287,983 views

5 years ago

Gate Smashers
Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

Subscribe to our new channel:https://www.youtube.com/@varunainashots ▻Artificial Intelligence (Complete Playlist): ...

14:34
Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

2,475,984 views

6 years ago

Gate Smashers
L-3.0: Divide and Conquer | Algorithm

How complex problems are solved efficiently in computer science? In this video, Varun sir will explain about Divide and Conquer ...

4:03
L-3.0: Divide and Conquer | Algorithm

1,064,012 views

4 years ago

Gate Smashers
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

In this video, Varun sir will solve the recurrence relation T(n)= 8T(n/2) + n^2 in a simplest way possible. This video will give you the ...

6:34
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

1,696,773 views

5 years ago