Network Layer | Ipv4 Datagram Fragmentation and Delays – Network Layer – Different Networks may have different maximum transmission unit (MTU),
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
Python Programming Overlapping Subproblems Property – Dynamic Programming – Dynamic Programming is an algorithmic paradigm that solves a complex problem
C programming K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time) – Searching and Sorting – Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array elements are distinct.
Sort an array in wave form – Searching and sorting – A Simple Solution is to use sorting. First sort the input array, then swap all adjacent elements.
Java Programming Overlapping Subproblems Property – Dynamic Programming – Dynamic Programming is an algorithmic paradigm that solves a given complex problem
Optimal Substructure Property – Dynamic Programming – A problem has Optimal Substructure Property if optimal solution of the given problem can be obtained
C++ programming K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time) – Searching and Sorting – Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array elements are distinct.
JAVA programming K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time) – Searching and Sorting – Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array elements are distinct.
C Programming Overlapping Subproblems Property – Dynamic Programming – Dynamic Programming is an algorithmic paradigm that solves a given complex problem
Search in an almost sorted array – Searching and Sorting – A simple solution is linearly search given key in given array.Time complexity of solution is O(n).We cab modify binary search to do it in O(Logn) time.