Data Structures And Algorithms - Find Largest Element and Second Largest Element in an Array

In this video, we’ll talk about some basic operations on fixed size arrays.We’ll see an interesting problem here, finding largest and second largest element in an array and display their indexes, we’ll see the algorithm used to find both of them and also, we’ll see 2 new terms- INT_MAX , INT_MIN.
In this video, you’ll also learn about asymptotic notations, they are basically mathematical notations which represent order of growth of any mathematical function. There are three famous notations which you’ll see in this video, they are big O , Theta , Omega.

Welcome to the first video Tutorial on Data Structures And Algorithms. In this video I am going to provide an Introduction to Data Structures And Algorithms. This Course is created to Explain the Fundamentals of data structures and algorithms. This video Will explain What is data?, What is data structure?, The Need for Data Structures, What is algorithm?

#DataStructures #Algorithms #DSandAlgo #ProgrammingKnowledge

★★★Top Online Courses From ProgrammingKnowledge ★★★

★★★ Online Courses to learn ★★★

★★★ Follow ★★★

DISCLAIMER: This video and description contains affiliate links, which means that if you click on one of the product links, I’ll receive a small commission. This help support the channel and allows us to continue to make videos like this. Thank you for the support!

[tusharverma]

Thanks for these amazing videos. One request, please increase font size or zoom in a bit for ease on eyes. Thanks again:)

[aminasworld]

السلام عليكم ورحمه الله وبركاته 👍👍👍👍 الله يوفقك يارب 🏵️🌺🌺

[ahsanrazamemon]

Hello. Thank you for your time and this amazing video.

When I enter this array in program ( int arr[] = {-1, 1, 5, 5, 0}; ), as result I get Largest as well as Second Largest Element = 5 which is incorrect.

Output 5(Largest) and 1(Second Largest). Kindly check it.