Array of objects Algorithms - Search, Sort, Reverse, Max, Min, Custom methods

[@CodeBeauty]

📚 Learn programming with these Free E-Books ⬇
C++ Lambdas e-book - free download here: bit.ly/freeCppE-Book
Entire Object-Pascal step-by-step guide - free download here: bit.ly/FreeObjectPascalEbook
🚀📈💻🔥 My Practical Programming Course: www.codebeautyacademy.com/
Experience the power of practical learning, gain career-ready skills, and start building real applications!
This is a step-by-step course designed to take you from beginner to expert in no time!
💰 Here is a coupon to save 10% on your first payment (CODEBEAUTY_YT10).
Use it quickly, because it will be available for a limited time.

[@milkamilkica1935]

I'm a student and you're the only reason why I get good grades on my exams

[@codeoasis1180]

best explanation of arrays and algorithms on that i could find on youtube

[@CodeBeauty]

always good to hear :D

[@dundyd3612]

I'm so happy that I found your channel. I can honesty say that you changed my life ❤❤

[@CodeBeauty]

I'm so glad!

[@hilgicamala2520]

thank you saldina, this is the video that I've been searching for

[@phoebewell3653]

I love the task at the end of the video. Very good for practicing

[@CodeBeauty]

Glad you liked it!

[@amelccc]

great job as always 👌👌

[@eliasrodriues6614]

Beautiful and smart teacher

[@CodeBeauty]

You are so kind

[@muatzdaw8283]

The best teacher ever, thank you for making anything easy 🤗🤗

[@CodeBeauty]

You're very welcome!

[@Alain-g8z]

I am sure it is going to be amazing class

[@Sam-k1i2i]

right on point, as usual, clear and concise, precious :)

[@CodeBeauty]

Thank you kindly!

[@MilesGerome]

great job, thank you Saldina, this is very helpful

[@marym9003]

this video is a treasure

[@OzzFan1000]

The tips about using pass by reference was most helpful to me. I need to play around with that some more to fully understand it. Thanks!

[@CodeBeauty]

Certainly, practice is everything and curiosity is always rewarded (in programming at least :D)

[@austineodhiambo4095]

You always inspire me through programming.

[@CodeBeauty]

🚀✨️

[@deanmorrison6254]

very helpful, thank you so much

[@CodeBeauty]

You're so welcome!

[@valjo02]

Excellent explanation and very good homework . Keep up doing new videos Saldina. I am very keen on programming 👍

[@CodeBeauty]

Use this link to sign up for my practical programming course and I will send you notification with the discount once it is published. I gave my best to make it as good as possible :)
Cheers.

[@raohammadraza]

superb Teacher thanks you so much.
Great job good teaching method

[@Alexander-iq5yq]

I am curious how "sort(students, student+5, compareByGrade)" works when compareByGrade would seem only to compare one element to the next. It would require many passes to sort the data, right? Is that what is happening automatically behind the scenes in sort(), or do I not understand?

[@bicycleninja1685]

Thanks, anything regarding data wrangling is interesting to me

[@nv9usb381]

Saldina should be grade 10 in the example 🥰

[@hsngraphics8228]

thanks for your support

[@CodeBeauty]

Always welcome

[@georgebentley-ricardo9445]

Huge thumbs up 🤠👍

[@ktoscos4546]

Name of channel match perfectly

[@CodeBeauty]

Thank you 🥰❤️

[@nissum5179]

After completing your video, something is definitely hard but its not the concept of array 😳❤

[@LakshmiM-f6k]

Hi saldina.. Any idea of starting advanced topics like mutex, semaphores, process sync topics? Most awaiting.

[@CodeBeauty]

I just added all of these topics to my too list. Thanks for the suggestions 🥰

[@nevram0101]

Thankyou

[@CodeBeauty]

You’re welcome 😊

[@muhmedgamal5841]

thank you

[@avion85]

Here's a new video idea: the same topics but using modern C++ features like ranges and lambdas. It would make for a nice contrast while making the code smaller, simpler and safer.

[@omerhusen906]

❤❤

[@dvongrad]

Other things to consider in searching and sorting are what to do if multiple students with the same name exist in a search, searching for grades above or below a certain value, and secondary sorts like descending grades sorted alphabetically by name for grades that occur more than once. Perhaps these concepts are beyond the scope of "beginner" tutorials...

[@keilooks]

Is this code available?

[@omarious]

Saldana has 7.2 and Alice has 10. Alice’s score was updated.

[@CodeBeauty]

Saldina* :D

[@omarious]

@@CodeBeauty Saldina! I stand corrected… my apologies.
Blaming: autocorrect!

[@wilgarcia1]

😻😻😻😻😻😻😻😻😻

[@rezafarokh8637]

Comment

[@bharathap780]

are there solution for your homework ? because i want to compare my solution to yours

[@Kingston7685]

Tum kya mila

[@nicholaskomsa1777]

Here's how I might do that:

struct Student {
std::string mName;
bool mGenderMale{ false };
int mGrade{ 0 };
Student(const std::string& name, bool isGenderMale, int grade)
: mName(name), mGenderMale(isGenderMale), mGrade(grade)
{}
};
std::array students = {
Student{"John", true, 20}
, {"Jane", false, 21}
, {"Jack", true, 22}
, {"jason", true, 23}
, {"nick", true, 24}
, {"nancy", false, 25}
};
std::string studentNameToFind = "Jane";
auto studentFound = std::find_if(std::execution::seq, students.begin(), students.end(), [&](const auto& student) {
return student.mName == studentNameToFind;
});
if (studentFound != students.end()) {
auto& [name, isMale, grade] = *studentFound;
std::cout b.mGrade;
});
auto& bestGrade = students.front();
auto& worstGrade = students.back();
//now sort by gender and grade
//females are in the front of the array and males are at the end
std::sort(std::execution::par, students.begin(), students.end(), [](const auto& a, const auto& b) {
return a.mGenderMale < b.mGenderMale || a.mGenderMale b.mGrade;
});
for (auto& student : students) {
std::cout