Channi Studies

In the final post, we looked into the selection sorting algorithm.https://code-studies.tistory.com/124 [Sorting] Insertion SortIn the final post, we have studied about the selection sort and its implementation in Python. https://code-studies.tistory.com/123 [Sorting] Introduction & Selection SortSorting Sorting is the process of converting a list of elements into ascending (code-studies.tistory...

In the final post, we have studied about the selection sort and its implementation in Python. https://code-studies.tistory.com/123 [Sorting] Introduction & Selection SortSorting Sorting is the process of converting a list of elements into ascending (or descending) order.You may remember the importance of sorting in binary search from my previous post. In the following few posts, we will be study..

Sorting Sorting is the process of converting a list of elements into ascending (or descending) order.You may remember the importance of sorting in binary search from my previous post. In the following few posts, we will be studying about the types of sorting algorithms. These are some examples of (un)sorted data(3, 9, 44, 18, 76): Not sorted(20, 15, 10, 5, 0): Sorted into descending order(99.87,..

Big O notation is a mathematical way of describing how a function (running time of an algorithm) generally behaves in relation to the input size. Given a function that describes the running time of an algorithm, the Big O notation for that function can be determined using the following rules:If f(N) is a sum of several terms, the highest order term (the one with the fastest growth rate) is kept ..