Return to Question

/* note that this implementation will not be acceptable as a submission -
 * it is NOT a true radix sort
 */
function myFakeRadixSort(array, key) {
 return array.sort(function(a, b) {
 return key(a) - key(b);
 });
}
/* this will be used as an example key function -
 * you will not need to implement this
 */
function complexity(obj) {
 return JSON.stringify(obj).length;
}
var tree = {
 a: {
 b: {
 c: "a string",
 d: 12
 },
 e: ["an", "array"]
 },
 f: true,
 g: {
 h: null,
 i: {},
 j: {
 k: 500
 }
 }
};
/* another example key function
 */
function index(obj) {
 return JSON.stringify(tree).indexOf(JSON.stringify(obj));
}
var data = [];
/* this is a hack to traverse the object */
JSON.stringify(tree, function(key, value) {
 data.push(value);
 return value;
});
document.write(`<h2>Sorted by "complexity"</h2>`);
document.write(`<pre>${myFakeRadixSort(data, complexity).map(o=>JSON.stringify(o)).join`\n`}</pre>`);
document.write(`<h2>Sorted by "index"</h2>`);
document.write(`<pre>${myFakeRadixSort(data, index).map(o=>JSON.stringify(o)).join`\n`}</pre>`);

/* note that this implementation will not be acceptable as a submission -
 * it is NOT a true radixvar sort
QUESTION_ID=71693,OVERRIDE_USER=42091;function *answersUrl(e){return"https://api.stackexchange.com/2.2/questions/"+QUESTION_ID+"/answers?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+ANSWER_FILTER}function myFakeRadixSortcommentUrl(arraye, keys){
 return arrayreturn"https://api.sortstackexchange.com/2.2/answers/"+s.join(";")+"/comments?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+COMMENT_FILTER}function(a, bgetAnswers(){
 return keyjQuery.ajax(a{url:answersUrl(answer_page++) - key,method:"get",dataType:"jsonp",crossDomain:!0,success:function(be);
 }{answers.push.apply(answers,e.items);
}
/* this will be used as an example key function -
 * you will not need to implement this
 */
,answers_hash=[],answer_ids=[],e.items.forEach(function complexity(obje){
 returne.comments=[];var JSONs=+e.stringifyshare_link.match(obj/\d+/);answer_ids.length;
push(s),answers_hash[s]=e}
var tree = {
 a:),e.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){
 b: jQuery.ajax({
 curl: "a string"commentUrl(comment_page++,
 d: 12
 }answer_ids),
 emethod: ["an", "array"]
 }"get",
 fdataType: true"jsonp",
 g: {
 hcrossDomain: null!0,
 isuccess:function(e){e.items.forEach(function(e){e.owner.user_id===OVERRIDE_USER&&answers_hash[e.post_id].comments.push(e)}),
 je.has_more?getComments(): {
 kmore_answers?getAnswers(): 500
 process()}})};
/*function anothergetAuthorName(e){return examplee.owner.display_name}function keyprocess(){var e=[];answers.forEach(function(s){var */
r=s.body;s.comments.forEach(function index(obje){
 return JSONOVERRIDE_REG.stringifytest(treee.body)&&(r="<h1>"+e.indexOfbody.replace(JSONOVERRIDE_REG,"")+"</h1>")});var a=r.stringifymatch(objSCORE_REG);a&&e.push({user:getAuthorName(s),size:+a[2],language:a[1],link:s.share_link});
}),e.sort(function(e,s){var data = [];
/* this isr=e.size,a=s.size;return r-a hack to traverse the object});var */
JSONs={},r=1,a=null,n=1;e.stringifyforEach(tree, function(keye){e.size!=a&&(n=r),a=e.size,++r;var valuet=jQuery("#answer-template").html();t=t.replace("{
 data{PLACE}}",n+".push").replace(value"{{NAME}}",e.user);
 return value;
.replace("{{LANGUAGE}}",e.language);
document.writereplace(`<h2>Sorted by "complexity"</h2>`"{{SIZE}}",e.size);
document.writereplace(`<pre>$"{myFakeRadixSort{LINK}}",e.link),t=jQuery(datat), complexityjQuery("#answers").mapappend(o=>JSONt);var o=e.stringifylanguage;/<a/.test(o)&&(o=jQuery(o).join`\n`text()),s[o]=s[o]||{lang:e.language,user:e.user,size:e.size,link:e.link}</pre>`});
document;var t=[];for(var o in s)s.writehasOwnProperty(`<h2>Sortedo)&&t.push(s[o]);t.sort(function(e,s){return bye.lang>s.lang?1:e.lang<s.lang?-1:0});for(var "index"</h2>`c=0;c<t.length;++c);
document{var i=jQuery("#language-template").writehtml(`<pre>$),o=t[c];i=i.replace("{myFakeRadixSort{LANGUAGE}}",o.lang).replace(data"{{NAME}}", indexo.user).mapreplace(o=>JSON"{{SIZE}}",o.stringifysize).replace("{{LINK}}",o.link),i=jQuery(i),jQuery("#languages").join`\n`append(i)}}var ANSWER_FILTER="!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe",COMMENT_FILTER="!)Q2B_A2kjfAiU78X(md6BoYk",answers=[],answers_hash,answer_ids,answer_page=1,more_answers=!0,comment_page;getAnswers();var SCORE_REG=/<h\d>\s*([^\n,]*[^\s,]),.*?(\d+|\d*\.\d+|\d+\.\d*)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/pre>`s>|[^\n<>]+>);[^\n\d<>]*)*<\/h\d>)/,OVERRIDE_REG=/^Override\s*header:\s*/i;

body{text-align:left!important}#answer-list,#language-list{padding:10px;width:290px;float:left}table thead{font-weight:700}table td{padding:5px}

<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <link rel="stylesheet" type="text/css" href="//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b"> <div id="answer-list"> <h2>Leaderboard</h2> <table class="answer-list"> <thead> <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr></thead> <tbody id="answers"> </tbody> </table> </div><div id="language-list"> <h2>Winners by Language</h2> <table class="language-list"> <thead> <tr><td>Language</td><td>User</td><td>Score</td></tr></thead> <tbody id="languages"> </tbody> </table> </div><table style="display: none"> <tbody id="answer-template"> <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table> <table style="display: none"> <tbody id="language-template"> <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table>

/* note that this implementation will not be acceptable as a submission -
 * it is NOT a true radix sort
 */function myFakeRadixSort(array, key){
 return array.sort(function(a, b){
 return key(a) - key(b);
 });
}
/* this will be used as an example key function -
 * you will not need to implement this
 */
function complexity(obj){
 return JSON.stringify(obj).length;
}
var tree = {
 a: {
 b: {
 c: "a string",
 d: 12
 },
 e: ["an", "array"]
 },
 f: true,
 g: {
 h: null,
 i:{},
 j: {
 k: 500
 }}};
/* another example key function */
function index(obj){
 return JSON.stringify(tree).indexOf(JSON.stringify(obj));
}var data = [];
/* this is a hack to traverse the object */
JSON.stringify(tree, function(key, value){
 data.push(value);
 return value;
});
document.write(`<h2>Sorted by "complexity"</h2>`);
document.write(`<pre>${myFakeRadixSort(data, complexity).map(o=>JSON.stringify(o)).join`\n`}</pre>`);
document.write(`<h2>Sorted by "index"</h2>`);
document.write(`<pre>${myFakeRadixSort(data, index).map(o=>JSON.stringify(o)).join`\n`}</pre>`);

##tl;dr

Write a radix sort with this signature, or as close as possible to this signature:

void *rsort(void *arr, int(*key)(const void *));

/* note that this implementation will not be acceptable as a submission -
 * it is NOT a true radix sort
 */
function myFakeRadixSort(array, key) {
 return array.sort(function(a, b) {
 return key(a) - key(b);
 });
}
/* this will be used as an example key function -
 * you will not need to implement this
 */
function complexity(obj) {
 return JSON.stringify(obj).length;
}
var tree = {
 a: {
 b: {
 c: "a string",
 d: 12
 },
 e: ["an", "array"]
 },
 f: true,
 g: {
 h: null,
 i: {},
 j: {
 k: 500
 }
 }
};
/* another example key function
 */
function index(obj) {
 return JSON.stringify(tree).indexOf(JSON.stringify(obj));
}
var data = [];
/* this is a hack to traverse the object */
JSON.stringify(tree, function(key, value) {
 data.push(value);
 return value;
});
document.write(`<h2>Sorted by "complexity"</h2>`);
document.write(`<pre>${myFakeRadixSort(data, complexity).map(o=>JSON.stringify(o)).join`\n`}</pre>`);
document.write(`<h2>Sorted by "index"</h2>`);
document.write(`<pre>${myFakeRadixSort(data, index).map(o=>JSON.stringify(o)).join`\n`}</pre>`);

##tl;dr

Write a radix sort with this signature, or as close as possible to this signature:

void *rsort(void *arr, int(*key)(const void *));

Leaderboards

var QUESTION_ID=71693,OVERRIDE_USER=42091;function answersUrl(e){return"https://api.stackexchange.com/2.2/questions/"+QUESTION_ID+"/answers?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+ANSWER_FILTER}function commentUrl(e,s){return"https://api.stackexchange.com/2.2/answers/"+s.join(";")+"/comments?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+COMMENT_FILTER}function getAnswers(){jQuery.ajax({url:answersUrl(answer_page++),method:"get",dataType:"jsonp",crossDomain:!0,success:function(e){answers.push.apply(answers,e.items),answers_hash=[],answer_ids=[],e.items.forEach(function(e){e.comments=[];var s=+e.share_link.match(/\d+/);answer_ids.push(s),answers_hash[s]=e}),e.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){jQuery.ajax({url:commentUrl(comment_page++,answer_ids),method:"get",dataType:"jsonp",crossDomain:!0,success:function(e){e.items.forEach(function(e){e.owner.user_id===OVERRIDE_USER&&answers_hash[e.post_id].comments.push(e)}),e.has_more?getComments():more_answers?getAnswers():process()}})}function getAuthorName(e){return e.owner.display_name}function process(){var e=[];answers.forEach(function(s){var r=s.body;s.comments.forEach(function(e){OVERRIDE_REG.test(e.body)&&(r="<h1>"+e.body.replace(OVERRIDE_REG,"")+"</h1>")});var a=r.match(SCORE_REG);a&&e.push({user:getAuthorName(s),size:+a[2],language:a[1],link:s.share_link})}),e.sort(function(e,s){var r=e.size,a=s.size;return r-a});var s={},r=1,a=null,n=1;e.forEach(function(e){e.size!=a&&(n=r),a=e.size,++r;var t=jQuery("#answer-template").html();t=t.replace("{{PLACE}}",n+".").replace("{{NAME}}",e.user).replace("{{LANGUAGE}}",e.language).replace("{{SIZE}}",e.size).replace("{{LINK}}",e.link),t=jQuery(t),jQuery("#answers").append(t);var o=e.language;/<a/.test(o)&&(o=jQuery(o).text()),s[o]=s[o]||{lang:e.language,user:e.user,size:e.size,link:e.link}});var t=[];for(var o in s)s.hasOwnProperty(o)&&t.push(s[o]);t.sort(function(e,s){return e.lang>s.lang?1:e.lang<s.lang?-1:0});for(var c=0;c<t.length;++c){var i=jQuery("#language-template").html(),o=t[c];i=i.replace("{{LANGUAGE}}",o.lang).replace("{{NAME}}",o.user).replace("{{SIZE}}",o.size).replace("{{LINK}}",o.link),i=jQuery(i),jQuery("#languages").append(i)}}var ANSWER_FILTER="!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe",COMMENT_FILTER="!)Q2B_A2kjfAiU78X(md6BoYk",answers=[],answers_hash,answer_ids,answer_page=1,more_answers=!0,comment_page;getAnswers();var SCORE_REG=/<h\d>\s*([^\n,]*[^\s,]),.*?(\d+|\d*\.\d+|\d+\.\d*)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/,OVERRIDE_REG=/^Override\s*header:\s*/i;

body{text-align:left!important}#answer-list,#language-list{padding:10px;width:290px;float:left}table thead{font-weight:700}table td{padding:5px}

<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <link rel="stylesheet" type="text/css" href="//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b"> <div id="answer-list"> <h2>Leaderboard</h2> <table class="answer-list"> <thead> <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr></thead> <tbody id="answers"> </tbody> </table> </div><div id="language-list"> <h2>Winners by Language</h2> <table class="language-list"> <thead> <tr><td>Language</td><td>User</td><td>Score</td></tr></thead> <tbody id="languages"> </tbody> </table> </div><table style="display: none"> <tbody id="answer-template"> <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table> <table style="display: none"> <tbody id="language-template"> <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table>

Here is a Stack Snippet to generate both a regular leaderboard and an overview of winners by language.

To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:

# Language Name, N bytes

where N is the size of your submission. If you improve your score, you can keep old scores in the headline, by striking them through. For instance:

# Ruby, <s>104</s> <s>101</s> 96 bytes

If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:

# Perl, 43 + 2 (-p flag) = 45 bytes

You can also make the language name a link which will then show up in the leaderboard snippet:

# [><>](http://esolangs.org/wiki/Fish), 121 bytes

/* note that this implementation will not be acceptable as a submission -
 * it is NOT a true radix sort
 */
function myFakeRadixSort(array, key) {
 return array.sort(function(a, b) {
 return key(a) - key(b);
 });
}
/* this will be used as an example key function -
 * you will not need to implement this
 */
function complexity(obj) {
 return JSON.stringify(obj).length;
}
var tree = {
 a: {
 b: {
 c: "a string",
 d: 12
 },
 e: ["an", "array"]
 },
 f: true,
 g: {
 h: null,
 i: {},
 j: {
 k: 500
 }
 }
};
/* another example key function
 */
function index(obj) {
 return JSON.stringify(tree).indexOf(JSON.stringify(obj));
}
var data = [];
/* this is a hack to traverse the object */
JSON.stringify(tree, function(key, value) {
 data.push(value);
 return value;
});
document.write(`<h2>Sorted by "complexity"</h2>`);
document.write(`<pre>${myFakeRadixSort(data, complexity).map(o=>JSON.stringify(o)).join`\n`}</pre>`);
document.write(`<h2>Sorted by "index"</h2>`);
document.write(`<pre>${myFakeRadixSort(data, index).map(o=>JSON.stringify(o)).join`\n`}</pre>`);