In recent years, programming and algorithm problem-solving skills have become a crucial assessment criterion not only in the IT industry but also in various fields. In this course, we will learn basic manipulation processes, algorithm design, and optimization through the problem of ‘Card Sorting’. This problem helps enhance understanding of important sorting algorithms in practical work and coding tests.<\/p>\n
In old card games, sorting the numbers on cards was essential. You have N cards, each with an integer written on it. You need to sort these cards in ascending order. However, there are some rules in this process:<\/p>\n
The first line contains the number of cards N, followed by N lines, each containing the number on each card.<\/p>\n
After sorting the cards in ascending order, print each card’s number on a new line.<\/p>\n
\nInput:\n5\n3\n1\n4\n1\n5\n\nOutput:\n1\n1\n3\n4\n5\n<\/pre>\nProblem-Solving Strategy<\/h2>\n
This problem is a sorting problem, and various sorting algorithms can be used. However, considering the given range, it is advisable to use basic sorting algorithms such as Quick Sort or Merge Sort. In this course, we will demonstrate how to efficiently solve the problem using the
std::sort<\/code> function included in the C++ STL.<\/p>\nSTL Standard Library’s
sort()<\/code> Function<\/h3>\nThe standard template library (STL) of C++ includes the
sort()<\/code> function. This function sorts the elements of the container provided as an argument.std::sort<\/code> has an average time complexity of O(N log N) and is very efficient.<\/p>\nCode Implementation<\/h2>\n
\n#include <iostream>\n#include <vector>\n#include <algorithm> \/\/ Include to use sort()\n\nint main() {\n int N;\n std::cin >> N; \/\/ Input the number of cards\n std::vector<int> cards(N); \/\/ Create a vector to store card numbers\n\n \/\/ Input card numbers\n for (int i = 0; i < N; i++) {\n std::cin >> cards[i];\n }\n\n \/\/ Sort card numbers\n std::sort(cards.begin(), cards.end());\n\n \/\/ Output sorted card numbers\n for (int i = 0; i < N; i++) {\n std::cout << cards[i] << std::endl;\n }\n\n return 0;\n}\n<\/code><\/pre>\nCode Analysis<\/h2>\n
The code above consists of the following processes:<\/p>\n
\n
- Library Inclusion:<\/strong> Includes
#include <iostream><\/code>,#include <vector><\/code>,#include <algorithm><\/code> to add basic libraries for input, output, and sorting.<\/li>\n- Input:<\/strong> Inputs the number of cards N from the user, and then stores the N card numbers in the vector.<\/li>\n
- Sorting:<\/strong> Uses the
std::sort()<\/code> function to sort the card numbers stored in the vector in ascending order. Here, thebegin()<\/code> andend()<\/code> methods are used to set the start and end positions.<\/li>\n- Output:<\/strong> Prints the sorted card numbers.<\/li>\n<\/ol>\n
Time Complexity Analysis<\/h2>\n