 Hey everybody, this is Brian and welcome to the 43rd Qt Tutorial with C++ and GUI programming. Today we're going to be going over an algorithm called Qsort. One thing you should probably do is go out and look up Qsort, and you'll see the Qt algorithms is a header that includes the generic algorithms. And these are how you really work with things such as lists and maps. Make your life a lot easier working with these things. So let's just dive right in and look at some code here. We're going to say Qlist. We're just going to give it some ints. And let's just say 2310. And let's say we want to sort that list. Well, first thing, let's actually do a for each. We're just going to print this list out here. And we will say Qdebug. So let's just print this list out to verify that, you know, sure enough we have our list and it's in the semi-random order here. And we want to sort this thing. So what we will do is say Qsort. And notice how it takes a container, or you can give it an iterator for the start and the end. So let's just give it the list container here. Run this. And that will sort the entire container. And you notice the other thing you could do is give it a begin and an end. So we'll say let's begin plus one. And we'll say list.end. We'll say minus one. Let's just see what happens here. Pile and run this. And you notice how it didn't sort the beginning or the end. It only sorted in the middle here. See how it goes two, there's two. And one and three are now reversed. Because you told it beginning plus one and minus one. So you get a range to sort within. Very simple. You have a very powerful algorithm that will help you out a lot. We'll hope you found this tutorial educational and entertaining. And thank you for watching.