Problem 1876. GJam: 2013 China Event: Name Sorting

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This Challenge is derived from</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/2933486/dashboard#s=p2\"><w:r><w:t>GJam 2013 China Moist</w:t></w:r></w:hyperlink><w:r><w:t>. The problem is Codified by making the input a cell array of names.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The Challenge involves a serial card sorting machine that places card (i+1) in its best position, 1 thru i, if the name on card (i+1) is lexicographically greater than the name on card (i). The machine continues thru the end of the deck. The machine then restarts at card 1 until the order is correct. The output to return is the number of card insertions. The character values follow ascii codes with Space &lt; A:Z &lt; a:z. A shorter name is less than an extended name (Ab&lt;Abe)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> names ( cell array of names )</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> Insertions (count of card insertions required)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Competition Summary:</w:t></w:r><w:r><w:t> Best Time 6 minutes, 793/1049 correct</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>names={'Stuart Beckingham' 'Rinata Araslanova' 'Jeremy Abbott' 'Daniil Barantsev' };</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Clearly takes 3 card insertions. Start (SRJD) moves [(RSJD) (JRSD) (DJRS)]</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This Challenge is derived from <a href = "http://code.google.com/codejam/contest/2933486/dashboard#s=p2">GJam 2013 China Moist</a>. The problem is Codified by making the input a cell array of names.The Challenge involves a serial card sorting machine that places card (i+1) in its best position, 1 thru i, if the name on card (i+1) is lexicographically greater than the name on card (i). The machine continues thru the end of the deck. The machine then restarts at card 1 until the order is correct. The output to return is the number of card insertions. The character values follow ascii codes with Space &lt; A:Z &lt; a:z. A shorter name is less than an extended name (Ab&lt;Abe)Input: names ( cell array of names )Output: Insertions (count of card insertions required)Competition Summary: Best Time 6 minutes, 793/1049 correctExample:names={'Stuart Beckingham' 'Rinata Araslanova' 'Jeremy Abbott' 'Daniil Barantsev' };Clearly takes 3 card insertions. Start (SRJD) moves [(RSJD) (JRSD) (DJRS)]

Solve

Solution Stats

18 Solutions
10 Solvers

Last Solution submitted on Oct 03, 2020

Last 200 Solutions

Solution Comments

Solution 320443

1 Comment

1 Comment

Richard Zapor on 17 Sep 2013

The functions unique and sort work magic for cell arrays of strings.

Problem Recent Solvers10

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1876. GJam: 2013 China Event: Name Sorting

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers10

Suggested Problems

More from this Author247

Problem Tags

Community Treasure Hunt

Problem 1876. GJam: 2013 China Event: Name Sorting

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers10

Suggested Problems

More from this Author247

Problem Tags

Community Treasure Hunt

Players