You are given an integer n and a cluster a1,a2,… ,an. You should reorder the components of the cluster an in such manner that the amount of MEX on prefixes (I-th prefix is a1,a2,… ,computer based intelligence) is expanded.    Officially, you should find an exhibit b1,b2,… ,bn, to such an extent that the arrangements of components of clusters an and b are equivalent (it is comparable to cluster b can be found as a cluster a with some

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Correct answer will be upvoted else downvoted. Computer science.

 

 You are given an integer n and a cluster a1,a2,… ,an. You should reorder the components of the cluster an in such manner that the amount of MEX on prefixes (I-th prefix is a1,a2,… ,computer based intelligence) is expanded. 

 

Officially, you should find an exhibit b1,b2,… ,bn, to such an extent that the arrangements of components of clusters an and b are equivalent (it is comparable to cluster b can be found as a cluster a with some reordering of its components) and ∑i=1nMEX(b1,b2,… ,bi) is expanded. 

 

MEX of a bunch of nonnegative integers is the insignificant nonnegative integer to such an extent that it isn't in the set. 

 

For instance, MEX({1,2,3})=0, MEX({0,1,2,4,5})=3. 

 

Input 

 

The principal line contains a solitary integer t (1≤t≤100) — the number of experiments. 

 

The principal line of each experiment contains a solitary integer n (1≤n≤100). 

 

The second line of each experiment contains n integers a1,a2,… ,an (0≤ai≤100). 

 

Output 

 

For each experiment print an exhibit b1,b2,… ,bn — the ideal reordering of a1,a2,… ,an, so the amount of MEX on its prefixes is amplified. 

 

On the off chance that there exist numerous ideal answers you can view as any.

 

 

Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

Blurred answer
Knowledge Booster
Types of trees
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education