\n There is height information for a group of students. You need to specify one student among them
\n and arrange the line so that this student stands at the front.
\n In this case, students shorter than the specified student must stand behind, and
\n the order of students with the same height must remain unchanged.
\n Write an algorithm that satisfies these conditions for lining up the students.\n <\/p>\n
\n An array containing the heights of students (e.g., [160, 170, 165, 180, 175])\n Height of the specified student (e.g., 170)\n <\/pre>\nOutput Format<\/h3>\n
\n An array of the lined-up students' heights (e.g., [170, 160, 165, 180, 175])\n <\/pre>\nProblem Solving Process<\/h2>\n
Step 1: Understand the Problem<\/h3>\n
\n The crux of the problem is to place the specified height student at the front of the given array, while
\n sorting the remaining students by height, maintaining their original order. This problem can primarily be solved using stable sorting.
\n The algorithm we will implement includes the following steps.\n <\/p>\nStep 2: Analyze a Simple Example<\/h3>\n
\n For example, if the input is[160, 170, 165, 180, 175]<\/code> and170<\/code>,
\n the lined-up result should be[170, 160, 165, 180, 175]<\/code>. The key point to note is
\n that when multiple students have the same height, their order must be preserved.\n <\/div>\nStep 3: Develop a Solution Strategy<\/h3>\n
\n The solution method is as follows.\n <\/p>\n
\n
- \n Find the student with the specified height in the given array and add that student as the first element of the result array.\n <\/li>\n
- \n Add the remaining students to the result array while maintaining their original order, excluding students with the same height.\n <\/li>\n
- \n Finally, return the modified array.\n <\/li>\n<\/ol>\n
Step 4: Implement JavaScript Code<\/h3>\n
\n Based on the above strategy, I will write a JavaScript function. This function will take two parameters and
\n serve to move the specified height student to the front.\n <\/p>\n\n\nfunction lineUpStudents(students, targetHeight) {\n \/\/ Declare an array to store the result\n let result = [];\n\n \/\/ First, add the student corresponding to targetHeight\n const targetStudents = students.filter(height => height === targetHeight);\n result.push(...targetStudents);\n\n \/\/ Add the remaining students (maintaining original order)\n const otherStudents = students.filter(height => height !== targetHeight);\n result.push(...otherStudents);\n\n return result;\n}\n <\/pre>\n<\/div>\nStep 5: Test and Validate the Code<\/h3>\n
\n I will run a few test cases to confirm that the function works correctly.\n <\/p>\n
\n\nconsole.log(lineUpStudents([160, 170, 165, 180, 175], 170)); \/\/ [170, 160, 165, 180, 175]\nconsole.log(lineUpStudents([160, 160, 165, 170, 180], 160)); \/\/ [160, 160, 165, 170, 180]\nconsole.log(lineUpStudents([180, 170, 160, 150], 160)); \/\/ [160, 180, 170, 150]\n <\/pre>\n<\/div>\nStep 6: Complexity Analysis<\/h3>\n