![]() ![]() In this problem, we are given a sequence of finite elements. A canonical example of such situation is a search problem. In some other algorithms, just by sorting your input data, you gain a possibility to perform your queries much more efficiently. For some algorithms, it is just as important to process given elements in non-decreasing order, going from smaller ones to larger ones. Once again, sorting is an important computational task used in many efficient algorithms. And your goal is to output these same elements in non-decreasing order. We will usually denote the sequence by A throughout this lesson. You are given a sequence of finite elements. The formal statement of this problem is as follows. Your input in this problem consists of a sequence of elements, and your goal is to output this element in, for example, non-decreasing order. So sorting is a fundamental computational problem. As usual, we start with a problem I'll review. ![]() Hello, and welcome to the sorting problem lesson. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |