- Видео 15
- Просмотров 48 762
BigOCast
Великобритания
Добавлен 17 фев 2022
Welcome to BigOCast, your go-to channel for intelligent discussions on software engineering and architecture. Join us as we navigate the intricacies of coding, explore software architecture, and stay abreast of industry trends. Subscribe for a refined yet enjoyable exploration of the tech landscape.
Code Duplication: D.R.Y
This episode will delve into patterns and tradeoffs involving duplication of code. We will try to answer the question: when is code duplication a reasonable tradeoff, and when should we avoid it?
We first start with duplicated code in two codebases, then reduce duplication by implementing a shared library, and finally
explore another approach by extracting common functionality using a microservice.
We first start with duplicated code in two codebases, then reduce duplication by implementing a shared library, and finally
explore another approach by extracting common functionality using a microservice.
Просмотров: 30
Видео
Decoding Decisions: A Deep Dive into Decision Records
Просмотров 608 месяцев назад
In our inaugural episode, join us as we unravel the world of Decision Records (DRs) - a crucial aspect of tech decision-making. What exactly is a DR, and why are they indispensable in the tech realm? From Security Decision Records (SDRs) to Design Decision Records (DDRs), we explore the various types that shape our digital landscape. Discover the immense benefits of Architecture Decision Record...
How having a decision record doc can help?
Просмотров 248 месяцев назад
🎙️ Dive into the world of efficient software development with our latest BigOCast episode! 🌐 In just one minute, discover the game-changing benefits of decision records for your projects. From streamlining onboarding processes to ensuring smooth ownership handovers during organizational changes, decision records are the key to quick comprehension and project success. Don't miss out on these ins...
Merge Sort Implementation
Просмотров 1272 года назад
Merge Sort is a Divide and Conquer algorithm. Merge sort divides the array into two halves recursively till the size becomes 1. Once the size becomes 1, the merge processes happen and start merging arrays back until the whole array is merged. In this video, we're talking about the implementation of the Merge Sort. Chapters: 0:00 Introduction 0:15 Implementation 2:20 Thank You Music from Free To...
Merge sort in 3 minutes!
Просмотров 1522 года назад
Merge Sort is a Divide and Conquer algorithm. Merge sort divides the array into two halves recursively till the size becomes 1. Once the size becomes 1, the merge processes happen and start merging arrays back until the whole array is merged. Chapters: 0:00 Introduction 0:10 How Merge sort works 2:52 Time Complexity 3:33 Thank You Music from Free To Use Music Track: Everyday by Jason Farnham ru...
Heap Sort Algorithm | Simple Explanation
Просмотров 1,4 тыс.2 года назад
Heap sort is a comparison based, in-place sorting algorithm. We can think of it as an improved version of selection sort as it divides the input into a sorted section and an unsorted section, but interestingly it keeps the unsorted section a max-binary-heap. This helps the heap sort to achieve the worst-case time complexity of O(nlogn). In this video, we talk about the max-binary-heap, and the ...
Optimised Bubble Sort
Просмотров 1,8 тыс.2 года назад
In this video, we’re gonna talk about the optimized version of Bubble sort, how it works and how this version is more efficient than the first version of Bubble sort. Bubble sort is the simplest of all sorting algorithms. What it does is walk through the array, compare adjacent items and if they are in the wrong order, swap them. Chapters: 0:00 Introduction 0:20 How Bubble sort works 2:14 Code ...
Selection Sort Algorithm
Просмотров 3322 года назад
Selection sort is a comparison sorting algorithm with quadratic (n^2) time complexity. It’s famous for its simplicity and as it’s an in-place sorting algorithm, it can perform on limited memory. However, it becomes inefficient when the size of data grows. The algorithm divides the input into a sorted and unsorted sublist. Each iteration finds the minimum of the unsorted sublist and swaps it wit...
Gnome Sort Algorithm, Child of Insertion and Bubble sort in 3 minutes!
Просмотров 3,1 тыс.2 года назад
Gnome sort (originally named stupid sort), is a variant of insertion sort but without nested loops. Interestingly it's implemented by just a single loop but it still has quadratic time complexity. This algorithm compares two adjacent items like Bubble sort and swaps them if they're not in the correct order. It's the simplest existing sorting algorithm. Chapters: 0:00 Introduction 0:32 Idea behi...
Bubble Sort Algorithm
Просмотров 4632 года назад
𝗕𝘂𝗯𝗯𝗹𝗲 𝗦𝗼𝗿𝘁 is the simplest of all sorting algorithms with quadratic - 𝗢(𝗻^𝟮) - running time. It works by comparing the adjacent items in an array and every time that it detects elements out of order, it swaps them. Chapters: 00:00 - Bubble sort's versions 00:26 - Real-world Example 01:12 - Idea 04:08 - Implementation 05:31 - Illustration 07:16 - Time Complexity 08:03 - Thank You Music in this ...
Recursive Insertion Sort
Просмотров 10 тыс.2 года назад
𝗜𝗻𝘀𝗲𝗿𝘁𝗶𝗼𝗻 𝘀𝗼𝗿𝘁 is one of the simplest sort algorithms with quadratic - 𝗢(𝗻^𝟮) - running time. It works the same way most of us sort cards in our hand, every time picking one card and inserting it in the correct position. We've explained the idea behind the algorithm in ruclips.net/video/S0LAMEg7f3Q/видео.html video and implemented the most common version of that. But it can have different imple...
Insertion Sort Algorithm
Просмотров 4732 года назад
Insertion Sort is one of the simplest sort algorithms with quadratic - O(n^2) - running time. It works the same way most of us sort cards in our hand, every time picking one card and inserting it in the correct position. In this video, we explain how insertion sort works, implement it in python and see how it sorts an array of numbers. Chapters: 00:00 - Idea 01:54 - Implementation 03:41 - Illus...
Jai shree ram 🚩
Nice video
Thanks🌹❤
mali ka met nong
I have seen other videos, and they say that with gnome sort, the way it would actually work in this array is that once element 3 is moved all the way to the beginning, it would compare element 4 with element 3 and swap, if necessary and then compare element 3 to element 2 and then swap if necessary, and so on and so forth until it ended up either comparing an element with the element before it, and coming to the conclusion that the right most element of the two elements being compared, was greater than or equal to the left most element of the two or reached the beginning of the array, whichever happened first. now I am totally confused as to which sword is gnome sort, and which sort is not.
Golden
thank you so much
You're welcome!
Great video! your explaination was very clear, allowed me to connect the dots that i was missing to understand it fully.
Your video would have been very good if I didn't have to mute the video eachtime you stop talking because of how loud the music is.
loved the recursive tree trace animation it made it very clear!!!!
what is the efficient way for if checks in the heapify method
Great Video! Thanks :)
sir please do such sorts for artificial intelligence and machine for easy understanding and quick access...
This video makes it easy to understand.......Thanks
amazin video，can you share your code, i want to learn it
Thank you. We're working to prepare a repo and share the codes there.
Is it possible to solve the runtime using master theorem?
Yes, Try to find a good link and share with you, if not, will create a video for covering it.
Thank you for this very well made and informative video!
Thank you!
brief and very helpful, thanks.
Glad it was helpful!
RUclips just recommended this channel to me. Honestly not bad videos, surprised I'm only the 42nd subscriber
Thank you for your subscription. It would be much appreciated if you could give us feedback to improve the quality.
@@bigocast For this video in particular, I feel like the calculation for the time complexity was a little bit fast. I was first confused when I saw the 'T' function. Even though it was declared vocally I had to rewind to understand. A simple visual saying "T(n) := time complexity" would've helped. And a quick refresher of what the 'n*(n+1)/n' formula means would help those who are unfamiliar with seeing it. Other than that not much to say Everything is direct and to the point, and the captions are a nice addition to have!
Excellent content and highly recommend.
Thank you :-)
Watch ruclips.net/video/9cIjvXEeOhQ/видео.html for "Gnome sort", a variant of Insertion sort that works just with a single loop. Please like the video and subscribe to the channel if you enjoyed it! Subscription Link: cutt.ly/HFTeWMv
Watch ruclips.net/video/uwV80JaZrPs/видео.html and see how recursive insertion sort works.
I made a my own algorithm that is also a child of bubble and insertion sort... but is so much better than this... AKA the fastest bubble sort - insertion sort super mod... name of this algorithm.. Josie Sort... I have a video of both my custom algorithms if you want to see them... mirror and josie
Great job, thanks!
Great! Keep it up.
Which algorithm would you like to see next? Let us know in the comment section. Please like the video and subscribe to the channel if you enjoyed it! Subscription Link: cutt.ly/HFTeWMv