Тёмный

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

Подписаться
Просмотров 13 тыс.
% 548

In this video, you will learn about algorithms and the most common operations used with arrays of objects. I will teach you how to perform searches for specific elements inside an array. You will also learn how to sort and reverse arrays, as well as how to find the minimum and maximum elements using specific criteria. To define these criteria, I'll teach you how to write custom methods for comparing elements within an array.
As usual, there will be a task for you at the end to test what you have learned from this video.
📚 Learn how to solve problems and build projects 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.
Download Visual Assist here: bit.ly/WT-CB
I use it to enhance the performance, features, and support for C, C#, and C++ development in Visual Studio.
Download Ultra Edit here: bit.ly/UE-CB
It is a powerful, secure text editor designed specifically for programmers.
☕ If you've found my content helpful and would like to support me, you now have the option to buy me a coffee or a cookie! It's a small gesture of gratitude that means a lot to me and helps me keep creating free educational videos for you. You can use the link below to make a contribution: bit.ly/CodeBeauty_BuyMeACoffee
However, please don't feel obligated to do so. I appreciate every one of you, and I will continue to share valuable content with you regardless of whether you choose to support me in this way. Thank you for being part of the Code Beauty community! ❤️😇
Related videos:
Array Data Structure (for absolute beginners) - ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-T76E09hnEuo.html
Array of Objects Introduction - ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-KoxzCeTAqw4.html
Dynamic Array of Objects - ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-igSuiwB7pBU.html
Classes and Objects for Beginners - ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-iVLQeWbgbXs.html
Types of Constructors - ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-hBq6EGX5II4.html
Contents:
00:00 - What you will learn in this video
01:47 - Explaining initial code
02:47 - Creating and initializing array of objects
04:09 - Algorithm for searching objects in the array
07:55 - Algorithm for sorting objects in the array
10:26 - Implementing custom method for comparing objects in array
13:14 - Good programming practices - passing data by reference vs passing data by value
15:14 - Implementing another custom method for comparing objects in array
16:02 - ASCII code explained
17:26 - Reversing array
18:20 - Finding max element in array
20:10 - Finding min element in array
21:07 - Practical task for you
Add me on other platforms for more educational content:
Instagram 📸 - TrueCodeBeauty
Twitter 🐦- TrueCodeBeauty

Наука

Опубликовано:

 

9 авг 2023

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 56   
@CodeBeauty
@CodeBeauty 11 месяцев назад
📚 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
@milkamilkica1935 11 месяцев назад
I'm a student and you're the only reason why I get good grades on my exams
@codeoasis1180
@codeoasis1180 11 месяцев назад
best explanation of arrays and algorithms on that i could find on youtube
@CodeBeauty
@CodeBeauty 11 месяцев назад
always good to hear :D
@hilgicamala2520
@hilgicamala2520 11 месяцев назад
thank you saldina, this is the video that I've been searching for
@amelccc
@amelccc 11 месяцев назад
great job as always 👌👌
@user-bc9vi2sl5k
@user-bc9vi2sl5k 11 месяцев назад
I am sure it is going to be amazing class
@dundyd3612
@dundyd3612 11 месяцев назад
I'm so happy that I found your channel. I can honesty say that you changed my life ❤❤
@CodeBeauty
@CodeBeauty 11 месяцев назад
I'm so glad!
@marym9003
@marym9003 11 месяцев назад
this video is a treasure
@phoebewell3653
@phoebewell3653 11 месяцев назад
I love the task at the end of the video. Very good for practicing
@CodeBeauty
@CodeBeauty 11 месяцев назад
Glad you liked it!
@eliasrodriues6614
@eliasrodriues6614 11 месяцев назад
Beautiful and smart teacher
@CodeBeauty
@CodeBeauty 11 месяцев назад
You are so kind
@user-sw8bq1rk9c
@user-sw8bq1rk9c 11 месяцев назад
great job, thank you Saldina, this is very helpful
@OzzFan1000
@OzzFan1000 11 месяцев назад
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
@CodeBeauty 11 месяцев назад
Certainly, practice is everything and curiosity is always rewarded (in programming at least :D)
@nv9usb381
@nv9usb381 11 месяцев назад
Saldina should be grade 10 in the example 🥰
@user-lu6kv9kr8u
@user-lu6kv9kr8u 11 месяцев назад
right on point, as usual, clear and concise, precious :)
@CodeBeauty
@CodeBeauty 11 месяцев назад
Thank you kindly!
@deanmorrison6254
@deanmorrison6254 11 месяцев назад
very helpful, thank you so much
@CodeBeauty
@CodeBeauty 11 месяцев назад
You're so welcome!
@raohammadraza7056
@raohammadraza7056 11 месяцев назад
superb Teacher thanks you so much. Great job good teaching method
@muatzdaw8283
@muatzdaw8283 11 месяцев назад
The best teacher ever, thank you for making anything easy 🤗🤗
@CodeBeauty
@CodeBeauty 11 месяцев назад
You're very welcome!
@bicycleninja1685
@bicycleninja1685 8 месяцев назад
Thanks, anything regarding data wrangling is interesting to me
@valjo02
@valjo02 11 месяцев назад
Excellent explanation and very good homework . Keep up doing new videos Saldina. I am very keen on programming 👍
@CodeBeauty
@CodeBeauty 11 месяцев назад
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.
@austineodhiambo4095
@austineodhiambo4095 8 месяцев назад
You always inspire me through programming.
@CodeBeauty
@CodeBeauty 8 месяцев назад
🚀✨️
@georgebentley-ricardo9445
@georgebentley-ricardo9445 11 месяцев назад
Huge thumbs up 🤠👍
@ktoscos4546
@ktoscos4546 11 месяцев назад
Name of channel match perfectly
@CodeBeauty
@CodeBeauty 11 месяцев назад
Thank you 🥰❤️
@avion85
@avion85 11 месяцев назад
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.
@muhmedgamal5841
@muhmedgamal5841 14 дней назад
thank you
@nissum5179
@nissum5179 11 месяцев назад
After completing your video, something is definitely hard but its not the concept of array 😳❤
@Alexander-iq5yq
@Alexander-iq5yq 4 месяца назад
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?
@hsngraphics8228
@hsngraphics8228 11 месяцев назад
thanks for your support
@CodeBeauty
@CodeBeauty 11 месяцев назад
Always welcome
@omerhusen906
@omerhusen906 11 месяцев назад
❤❤
@nevram0101
@nevram0101 11 месяцев назад
Thankyou
@CodeBeauty
@CodeBeauty 11 месяцев назад
You’re welcome 😊
@dvongrad
@dvongrad 10 месяцев назад
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...
@user-en9bu9lg1g
@user-en9bu9lg1g 11 месяцев назад
Hi saldina.. Any idea of starting advanced topics like mutex, semaphores, process sync topics? Most awaiting.
@CodeBeauty
@CodeBeauty 11 месяцев назад
I just added all of these topics to my too list. Thanks for the suggestions 🥰
@wilgarcia1
@wilgarcia1 11 месяцев назад
😻😻😻😻😻😻😻😻😻
@omarious
@omarious 11 месяцев назад
Saldana has 7.2 and Alice has 10. Alice’s score was updated.
@CodeBeauty
@CodeBeauty 11 месяцев назад
Saldina* :D
@omarious
@omarious 11 месяцев назад
@@CodeBeauty Saldina! I stand corrected… my apologies. Blaming: autocorrect!
@tusharghosh5432
@tusharghosh5432 7 месяцев назад
I have a doubt. When you call the global function compareByGrade from main function, you actually did not pass it with parenthesis how is it possible?
@rezafarokh8637
@rezafarokh8637 11 месяцев назад
Comment
@Kingston7685
@Kingston7685 11 месяцев назад
Tum kya mila
@nicholaskomsa1777
@nicholaskomsa1777 2 месяца назад
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
@bharathap780
@bharathap780 10 месяцев назад
are there solution for your homework ? because i want to compare my solution to yours