Find Min and Max element from an Array using less number of Comparisons
JOIN ME
—————
YouTube 🎬 / @cppnuts
Patreon 🚀 / cppnuts
COMPLETE PLAYLIST
————————————
C++ Tutorial For Beginners: • Introduction To C++
STL (Standard Template Library): • STL In C++
ThreadIng In C++: • Multithreading In C++
Data Structures: • Data Structure
Algorithms: • Binary Search
Design Patterns: • Factory Design Pattern in C++
Smart Pointers: • Smart Pointer In C++
C++14: • Digit Separator In C++
C++17: • std string_view in C++17 | Fastest St...
C++ All Type Casts: • static_cast In C++
INTERVIEW PLAYLIST
————————————
C++ Interview Q&A: • Structural Padding & Packing In C & C++
C++ Interview Q&A For Experienced: • How delete[] Knows How Much To Deall...
Linked List Interview Questions: • Find Kth Node From Back In Singly Lin...
BST Interview Questions: • Search Element In Binary Search Tree ...
Array Interview Questions: • Reverse An Array
String Interview Questions: • Check String Is Palindrome Or Not
Bit Manipulation Questions: • Find Set Bit In Integer Number
Binary Tree Interview Question: • Invert Binary Tree
Sorting Algorithms: • Bubble Sort
C++ MCQ: • Video
C MCQ: • What printf returns after printing? |...
C Interview Questions: • Designated Initialization In C
QUICK SHORT VIDEOS
————————————-
C++ Short : • C++ Short Videos
C Short : • Shorts C Programming MCQ
Time Lines
=========
0:05 Introduction
0:18 Brute Force Approach
2:22 Best Approach
2:22 Best Approach
4:48 Code Explanation
In this video we will learn how to find the minimum and the maximum element from an array using less number of comparisons.
This is beginner level interview question for computer science and electronics background students. Generally we compare each element with min and max both the variable and that is not good solutions.
In this video i have explained that we can compare elements in pair and get better complexity.
Let me know if there is any doubt, we can discussion in comment section.
#ArrayInterview #Array #dsa #InterviewQuestion #DataStructure