Codecrucks

Relations on sets: Reflexivity, symmetry, transitivity, anti-symmetricity, equivalence, partial order, etc..
Access the full playlist here: http://shorturl.at/inryW







https://www.youtube.com/watch?v=quhkuk9uSlg&list=PLUVnh0w_cCjJ50vH6505Bk7Zv-2f8rltw&index=4

Relations on Set || Types of Relations || Reflexive || Symmetric || Theory of Computation || L-4 This video covers the concepts of Relations on set. A binary relation is a subset of the cartesian product of two sets. Relation includes only those tuples f...

The entire video course on Fuzzy Logic (Soft Computing) is available now. Just hit the link and have it:

https://www.youtube.com/c/CodeCrucks/?sub_confirmation=1

Happy learning

It is a linear-time O(n) searching algorithm, is also known as sequential search. Go, explore and learn

https://www.youtube.com/c/CodeCrucks/?sub_confirmation=1

Linear Search Linear search is a straightforward method of searching. It is sometimes referred to as sequential search. Assume A is an n-dimensional array. We wish to find an element in this array. This element will be referred to as a 'Key.' The Key is compared to each element of the array

Learn all classical sorting methods at single place with explanation, Algorithm, Complexity analysis, , Example, Simulation, Application, Limitations, Properties and Comparisons. Click to read
https://codecrucks.com/bubble-sort/
https://codecrucks.com/selection-sort/
https://codecrucks.com/insertion-sort/
https://codecrucks.com/heap-sort/
https://codecrucks.com/shell-sort/
https://codecrucks.com/merge-sort/
https://codecrucks.com/quick-sort/
https://codecrucks.com/counting-sort/
https://codecrucks.com/radix-sort/
https://codecrucks.com/bucket-sort/

Bucket sort is also known as bin sort. It is a sorting algorithm that divides an array’s items into a number of buckets. The buckets are then sorted one at a time, either using a separate sorting method or by recursively applying the bucket sorting algorithm.

Bucket Sort Bucket sort is also known as bin sort. It is a sorting algorithm that divides an array's items into a number of buckets. The buckets are then sorted one at a time, either using a separate sorting method or by recursively applying the bucket sorting algorithm.

It is linear time sorting technique. It organizes data based on digit position, beginning with the LSB and progressing to the MSD.

Radix Sort Another linear time technique is radix sort. It organizes data based on digit position, beginning with the least significant digit and progressing to the most significant digit. Keys are sorted on the i-th digit in each iteration i. The name comes from the way algorithm works. It sorts the elements

Counting sort is an integer sorting algorithm. It sorts data based on the frequency of the elements. This is a linear-time algorithm and beats popular algorithms such as merge sort, quick sort, insertion sort etc.

Counting Sort Counting sort is quite old sorting method. It was introduced by Harold Seward in 1954. It is non comparison based, non in-place sorting algorithm. It sorts data based on the frequency of the elements. it is an integer sorting algorithm. Assumption: Input to the algorithm is non negative integers

Understand how quicksort works. Step by step simulation of example, complexity analysis, algorithm, applications, limitations and many more.

Quick Sort Quick sort was invented by Tony H***e. It is a divide and conquer strategy. Quicksort is sometimes referred to as partition exchange sort. Quick sort picks one element as a pivot and shifts the pivot to the correct location in each iteration. By repositioning the pivot, the list is

Merge sort is a non-adaptive, non-inplace sorting algorithm. It operates in O(nlogn) time even in the worst case. Learn how exactly it works with diagrams, algorithms, examples, complexity analysis, and many more.

Merge Sort Merge sort sorts the list using divide and conquers strategy. Unlike selection sort, bubble sort or insertion sort, it sorts data by dividing the list into sub lists and recursively solving and combining them. It works on following

It is also known as diminishing increment sort. Like selection sort, bubble sort and insertion sort, shell sort is also a comparison-based in-place sorting algorithm. Learn more on codecrucks

Shell Sort It is also known as diminishing increment sort. Like selection sort, bubble sort and insertion sort, shell sort is also a comparison based in-place sorting algorithm. It sorts groups of elements separated by a