Function for SortBy
2
Let's say I have the following list
list = {{-1, 0, 0, 1}, {-1, 0, 1, 0}, {-1, 1, 0, 0}, {0, -1, 0, 1},
{0, -1, 1, 0}, {0, 0, -1, 1}, {0, 0, 1, -1}, {0, 1, -1, 0},
{0, 1, 0, -1}, {1, -1, 0, 0}, {1, 0, -1, 0}, {1, 0, 0, -1}}
What sort function (sfunc) used in SortBy [list, sfunc] can give me slist?
slist = {{0, 0, 1, -1}, {0, 0, -1, 1}, {0, -1, 0, 1}, {-1, 0, 0, 1},
{0, 1, 0, -1}, {0, 1, -1, 0}, {0, -1, 1, 0}, {-1, 0, 1, 0},
{1, 0, 0, -1}, {1, 0, -1, 0}, {1, -1, 0, 0}, {-1, 1, 0, 0}}
Few examples of sorted data
slist1 = {{0, 0, 1, -2}, {0, 0, -2, 1}, {0, -2, 0, 1}, {-2, 0, 0, 1}, {0, 1, 0, -2}, {0, 1, -2, 0}, {0, -2, 1, 0}, {-2, 0, 1, 0}, {1, 0, 0, -2}, {1, 0, -2, 0}, {1, -2, 0, 0}, {-2, 1, 0, 0}, {0, 1, -1, -1}, {0, -1, 1, -1}, {0, -1, -1, 1}, {-1, 0, 1, -1}, {-1, 0, -1, 1},{-1, -1, 0, 1}, {1, 0, -1, -1}, {1, -1, 0, -1}, {1, -1, -1, 0}, {-1, 1, 0, -1}, {-1, 1, -1, 0}, {-1, -1, 1, 0}}
slist2 = {{0, 0, 2, -2}, {0, 0, -2, 2}, {0, -2, 0, 2}, {-2, 0, 0, 2}, {0, 1, 1, -2}, {0, 1, -2, 1}, {0, -2, 1, 1}, {-2, 0, 1, 1}, {0, 2, 0, -2}, {0, 2, -2, 0}, {0, -2, 2, 0}, {-2, 0, 2, 0}, {1, 0, 1, -2}, {1, 0, -2, 1}, {1, -2, 0, 1}, {-2, 1, 0, 1}, {1, 1, 0, -2}, {1, 1, -2, 0}, {1, -2, 1, 0}, {-2, 1, 1, 0}, {2, 0, 0, -2}, {2, 0, -2, 0}, {2, -2, 0, 0}, {-2, 2, 0, 0}, {0, 2, -1, -1}, {0, -1, 2, -1}, {0, -1, -1, 2}, {-1, 0, 2, -1}, {-1, 0, -1, 2}, {-1, -1, 0, 2}, {1, 1, -1, -1}, {1, -1, 1, -1}, {1, -1, -1, 1}, {-1, 1, 1, -1}, {-1, 1, -1, 1}, {-1, -1, 1, 1}, {2, 0, -1, -1}, {2, -1, 0, -1}, {2, -1, -1, 0}, {-1, 2, 0, -1}, {-1, 2, -1, 0}, {-1, -1, 2, 0}}
list-manipulation sorting
asked yesterday
Hubble07
2,904720
add a comment |
2
Let's say I have the following list
list = {{-1, 0, 0, 1}, {-1, 0, 1, 0}, {-1, 1, 0, 0}, {0, -1, 0, 1},
{0, -1, 1, 0}, {0, 0, -1, 1}, {0, 0, 1, -1}, {0, 1, -1, 0},
{0, 1, 0, -1}, {1, -1, 0, 0}, {1, 0, -1, 0}, {1, 0, 0, -1}}
What sort function (sfunc) used in SortBy [list, sfunc] can give me slist?
slist = {{0, 0, 1, -1}, {0, 0, -1, 1}, {0, -1, 0, 1}, {-1, 0, 0, 1},
{0, 1, 0, -1}, {0, 1, -1, 0}, {0, -1, 1, 0}, {-1, 0, 1, 0},
{1, 0, 0, -1}, {1, 0, -1, 0}, {1, -1, 0, 0}, {-1, 1, 0, 0}}
Few examples of sorted data
slist1 = {{0, 0, 1, -2}, {0, 0, -2, 1}, {0, -2, 0, 1}, {-2, 0, 0, 1}, {0, 1, 0, -2}, {0, 1, -2, 0}, {0, -2, 1, 0}, {-2, 0, 1, 0}, {1, 0, 0, -2}, {1, 0, -2, 0}, {1, -2, 0, 0}, {-2, 1, 0, 0}, {0, 1, -1, -1}, {0, -1, 1, -1}, {0, -1, -1, 1}, {-1, 0, 1, -1}, {-1, 0, -1, 1},{-1, -1, 0, 1}, {1, 0, -1, -1}, {1, -1, 0, -1}, {1, -1, -1, 0}, {-1, 1, 0, -1}, {-1, 1, -1, 0}, {-1, -1, 1, 0}}
slist2 = {{0, 0, 2, -2}, {0, 0, -2, 2}, {0, -2, 0, 2}, {-2, 0, 0, 2}, {0, 1, 1, -2}, {0, 1, -2, 1}, {0, -2, 1, 1}, {-2, 0, 1, 1}, {0, 2, 0, -2}, {0, 2, -2, 0}, {0, -2, 2, 0}, {-2, 0, 2, 0}, {1, 0, 1, -2}, {1, 0, -2, 1}, {1, -2, 0, 1}, {-2, 1, 0, 1}, {1, 1, 0, -2}, {1, 1, -2, 0}, {1, -2, 1, 0}, {-2, 1, 1, 0}, {2, 0, 0, -2}, {2, 0, -2, 0}, {2, -2, 0, 0}, {-2, 2, 0, 0}, {0, 2, -1, -1}, {0, -1, 2, -1}, {0, -1, -1, 2}, {-1, 0, 2, -1}, {-1, 0, -1, 2}, {-1, -1, 0, 2}, {1, 1, -1, -1}, {1, -1, 1, -1}, {1, -1, -1, 1}, {-1, 1, 1, -1}, {-1, 1, -1, 1}, {-1, -1, 1, 1}, {2, 0, -1, -1}, {2, -1, 0, -1}, {2, -1, -1, 0}, {-1, 2, 0, -1}, {-1, 2, -1, 0}, {-1, -1, 2, 0}}
list-manipulation sorting
asked yesterday
Hubble07
2,904720
4
Explain the core idea behind your sorted list. It certainly isn't clear what you're seeking.
– David G. Stork
yesterday
2
Can you give some examples with more complicated data?
– MikeY
yesterday
1
@MikeY I have added 2 more sorted sets.
– Hubble07
yesterday
So if you sort your data like this, it can probably be counted and therefore indexed in closed form.
– MikeY
15 hours ago
@MikeY Yes I have decided to use this sorting. I have edited by bounty question. If you have time then you could answer that, then I can gladly give you the bounty.
– Hubble07
8 hours ago
add a comment |
2
2
2
Let's say I have the following list
list = {{-1, 0, 0, 1}, {-1, 0, 1, 0}, {-1, 1, 0, 0}, {0, -1, 0, 1},
{0, -1, 1, 0}, {0, 0, -1, 1}, {0, 0, 1, -1}, {0, 1, -1, 0},
{0, 1, 0, -1}, {1, -1, 0, 0}, {1, 0, -1, 0}, {1, 0, 0, -1}}
What sort function (sfunc) used in SortBy [list, sfunc] can give me slist?
slist = {{0, 0, 1, -1}, {0, 0, -1, 1}, {0, -1, 0, 1}, {-1, 0, 0, 1},
{0, 1, 0, -1}, {0, 1, -1, 0}, {0, -1, 1, 0}, {-1, 0, 1, 0},
{1, 0, 0, -1}, {1, 0, -1, 0}, {1, -1, 0, 0}, {-1, 1, 0, 0}}
Few examples of sorted data
slist1 = {{0, 0, 1, -2}, {0, 0, -2, 1}, {0, -2, 0, 1}, {-2, 0, 0, 1}, {0, 1, 0, -2}, {0, 1, -2, 0}, {0, -2, 1, 0}, {-2, 0, 1, 0}, {1, 0, 0, -2}, {1, 0, -2, 0}, {1, -2, 0, 0}, {-2, 1, 0, 0}, {0, 1, -1, -1}, {0, -1, 1, -1}, {0, -1, -1, 1}, {-1, 0, 1, -1}, {-1, 0, -1, 1},{-1, -1, 0, 1}, {1, 0, -1, -1}, {1, -1, 0, -1}, {1, -1, -1, 0}, {-1, 1, 0, -1}, {-1, 1, -1, 0}, {-1, -1, 1, 0}}
slist2 = {{0, 0, 2, -2}, {0, 0, -2, 2}, {0, -2, 0, 2}, {-2, 0, 0, 2}, {0, 1, 1, -2}, {0, 1, -2, 1}, {0, -2, 1, 1}, {-2, 0, 1, 1}, {0, 2, 0, -2}, {0, 2, -2, 0}, {0, -2, 2, 0}, {-2, 0, 2, 0}, {1, 0, 1, -2}, {1, 0, -2, 1}, {1, -2, 0, 1}, {-2, 1, 0, 1}, {1, 1, 0, -2}, {1, 1, -2, 0}, {1, -2, 1, 0}, {-2, 1, 1, 0}, {2, 0, 0, -2}, {2, 0, -2, 0}, {2, -2, 0, 0}, {-2, 2, 0, 0}, {0, 2, -1, -1}, {0, -1, 2, -1}, {0, -1, -1, 2}, {-1, 0, 2, -1}, {-1, 0, -1, 2}, {-1, -1, 0, 2}, {1, 1, -1, -1}, {1, -1, 1, -1}, {1, -1, -1, 1}, {-1, 1, 1, -1}, {-1, 1, -1, 1}, {-1, -1, 1, 1}, {2, 0, -1, -1}, {2, -1, 0, -1}, {2, -1, -1, 0}, {-1, 2, 0, -1}, {-1, 2, -1, 0}, {-1, -1, 2, 0}}
list-manipulation sorting
asked yesterday
Hubble07
2,904720
Let's say I have the following list
list = {{-1, 0, 0, 1}, {-1, 0, 1, 0}, {-1, 1, 0, 0}, {0, -1, 0, 1},
{0, -1, 1, 0}, {0, 0, -1, 1}, {0, 0, 1, -1}, {0, 1, -1, 0},
{0, 1, 0, -1}, {1, -1, 0, 0}, {1, 0, -1, 0}, {1, 0, 0, -1}}
What sort function (sfunc) used in SortBy [list, sfunc] can give me slist?
slist = {{0, 0, 1, -1}, {0, 0, -1, 1}, {0, -1, 0, 1}, {-1, 0, 0, 1},
{0, 1, 0, -1}, {0, 1, -1, 0}, {0, -1, 1, 0}, {-1, 0, 1, 0},
{1, 0, 0, -1}, {1, 0, -1, 0}, {1, -1, 0, 0}, {-1, 1, 0, 0}}
Few examples of sorted data
slist1 = {{0, 0, 1, -2}, {0, 0, -2, 1}, {0, -2, 0, 1}, {-2, 0, 0, 1}, {0, 1, 0, -2}, {0, 1, -2, 0}, {0, -2, 1, 0}, {-2, 0, 1, 0}, {1, 0, 0, -2}, {1, 0, -2, 0}, {1, -2, 0, 0}, {-2, 1, 0, 0}, {0, 1, -1, -1}, {0, -1, 1, -1}, {0, -1, -1, 1}, {-1, 0, 1, -1}, {-1, 0, -1, 1},{-1, -1, 0, 1}, {1, 0, -1, -1}, {1, -1, 0, -1}, {1, -1, -1, 0}, {-1, 1, 0, -1}, {-1, 1, -1, 0}, {-1, -1, 1, 0}}
slist2 = {{0, 0, 2, -2}, {0, 0, -2, 2}, {0, -2, 0, 2}, {-2, 0, 0, 2}, {0, 1, 1, -2}, {0, 1, -2, 1}, {0, -2, 1, 1}, {-2, 0, 1, 1}, {0, 2, 0, -2}, {0, 2, -2, 0}, {0, -2, 2, 0}, {-2, 0, 2, 0}, {1, 0, 1, -2}, {1, 0, -2, 1}, {1, -2, 0, 1}, {-2, 1, 0, 1}, {1, 1, 0, -2}, {1, 1, -2, 0}, {1, -2, 1, 0}, {-2, 1, 1, 0}, {2, 0, 0, -2}, {2, 0, -2, 0}, {2, -2, 0, 0}, {-2, 2, 0, 0}, {0, 2, -1, -1}, {0, -1, 2, -1}, {0, -1, -1, 2}, {-1, 0, 2, -1}, {-1, 0, -1, 2}, {-1, -1, 0, 2}, {1, 1, -1, -1}, {1, -1, 1, -1}, {1, -1, -1, 1}, {-1, 1, 1, -1}, {-1, 1, -1, 1}, {-1, -1, 1, 1}, {2, 0, -1, -1}, {2, -1, 0, -1}, {2, -1, -1, 0}, {-1, 2, 0, -1}, {-1, 2, -1, 0}, {-1, -1, 2, 0}}
list-manipulation sorting
list-manipulation sorting
asked yesterday
Hubble07
2,904720
asked yesterday
Hubble07
2,904720
edited yesterday
asked yesterday
Hubble07
2,904720
asked yesterday
Hubble07
2,904720
asked yesterday
Hubble07
2,904720
2,904720
4
Explain the core idea behind your sorted list. It certainly isn't clear what you're seeking.
– David G. Stork
yesterday
2
Can you give some examples with more complicated data?
– MikeY
yesterday
1
@MikeY I have added 2 more sorted sets.
– Hubble07
yesterday
So if you sort your data like this, it can probably be counted and therefore indexed in closed form.
– MikeY
15 hours ago
@MikeY Yes I have decided to use this sorting. I have edited by bounty question. If you have time then you could answer that, then I can gladly give you the bounty.
– Hubble07
8 hours ago
add a comment |
4
Explain the core idea behind your sorted list. It certainly isn't clear what you're seeking.
– David G. Stork
yesterday
2
Can you give some examples with more complicated data?
– MikeY
yesterday
1
@MikeY I have added 2 more sorted sets.
– Hubble07
yesterday
So if you sort your data like this, it can probably be counted and therefore indexed in closed form.
– MikeY
15 hours ago
@MikeY Yes I have decided to use this sorting. I have edited by bounty question. If you have time then you could answer that, then I can gladly give you the bounty.
– Hubble07
8 hours ago
4
4
Explain the core idea behind your sorted list. It certainly isn't clear what you're seeking.
– David G. Stork
yesterday
Explain the core idea behind your sorted list. It certainly isn't clear what you're seeking.
– David G. Stork
yesterday
2
2
Can you give some examples with more complicated data?
– MikeY
yesterday
Can you give some examples with more complicated data?
– MikeY
yesterday
1
1
@MikeY I have added 2 more sorted sets.
– Hubble07
yesterday
@MikeY I have added 2 more sorted sets.
– Hubble07
yesterday
So if you sort your data like this, it can probably be counted and therefore indexed in closed form.
– MikeY
15 hours ago
So if you sort your data like this, it can probably be counted and therefore indexed in closed form.
– MikeY
15 hours ago
@MikeY Yes I have decided to use this sorting. I have edited by bounty question. If you have time then you could answer that, then I can gladly give you the bounty.
– Hubble07
8 hours ago
@MikeY Yes I have decided to use this sorting. I have edited by bounty question. If you have time then you could answer that, then I can gladly give you the bounty.
– Hubble07
8 hours ago
add a comment |
1 Answer
1
active
oldest
votes
8
EDITED TO FIX ERROR COPYING OVER FUNCTION
For the data sets, you are sorting on
- the number of negative numbers first, then
- the subset of just the nonnegative elements (using canonical ordering for lists), then
- the binary term gained when you replace a negative term with a '1' and a nonnegative with a '0'
The canonical ordering otherwise
funkySort[list_]:= SortBy[list,{
Count[#, _?Negative] &,
Select[#, NonNegative] &,
Negative
}]
slist == funkySort[slist[[RandomPermutation[Length[slist]]]]]
slist1 == funkySort[slist1[[RandomPermutation[Length[slist1]]]]]
slist2 == funkySort[slist2[[RandomPermutation[Length[slist2]]]]]
True
True
True
answered yesterday
MikeY
2,162410
Butslist != funkySort[list]. Are you sure this works. It doesn't seem to work on my system. Do you get really getslist1andslist2when your function is applied to any random ordering of those lists.
– Hubble07
21 hours ago
Oops, copied over the wrongfunkySort[ ]from my notebook. Fixed it...
– MikeY
18 hours ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "387"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f188839%2ffunction-for-sortby%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
8
EDITED TO FIX ERROR COPYING OVER FUNCTION
For the data sets, you are sorting on
- the number of negative numbers first, then
- the subset of just the nonnegative elements (using canonical ordering for lists), then
- the binary term gained when you replace a negative term with a '1' and a nonnegative with a '0'
The canonical ordering otherwise
funkySort[list_]:= SortBy[list,{
Count[#, _?Negative] &,
Select[#, NonNegative] &,
Negative
}]
slist == funkySort[slist[[RandomPermutation[Length[slist]]]]]
slist1 == funkySort[slist1[[RandomPermutation[Length[slist1]]]]]
slist2 == funkySort[slist2[[RandomPermutation[Length[slist2]]]]]
True
True
True
answered yesterday
MikeY
2,162410
Butslist != funkySort[list]. Are you sure this works. It doesn't seem to work on my system. Do you get really getslist1andslist2when your function is applied to any random ordering of those lists.
– Hubble07
21 hours ago
Oops, copied over the wrongfunkySort[ ]from my notebook. Fixed it...
– MikeY
18 hours ago
add a comment |
8
EDITED TO FIX ERROR COPYING OVER FUNCTION
For the data sets, you are sorting on
- the number of negative numbers first, then
- the subset of just the nonnegative elements (using canonical ordering for lists), then
- the binary term gained when you replace a negative term with a '1' and a nonnegative with a '0'
The canonical ordering otherwise
funkySort[list_]:= SortBy[list,{
Count[#, _?Negative] &,
Select[#, NonNegative] &,
Negative
}]
slist == funkySort[slist[[RandomPermutation[Length[slist]]]]]
slist1 == funkySort[slist1[[RandomPermutation[Length[slist1]]]]]
slist2 == funkySort[slist2[[RandomPermutation[Length[slist2]]]]]
True
True
True
answered yesterday
MikeY
2,162410
Butslist != funkySort[list]. Are you sure this works. It doesn't seem to work on my system. Do you get really getslist1andslist2when your function is applied to any random ordering of those lists.
– Hubble07
21 hours ago
Oops, copied over the wrongfunkySort[ ]from my notebook. Fixed it...
– MikeY
18 hours ago
add a comment |
8
8
8
EDITED TO FIX ERROR COPYING OVER FUNCTION
For the data sets, you are sorting on
- the number of negative numbers first, then
- the subset of just the nonnegative elements (using canonical ordering for lists), then
- the binary term gained when you replace a negative term with a '1' and a nonnegative with a '0'
The canonical ordering otherwise
funkySort[list_]:= SortBy[list,{
Count[#, _?Negative] &,
Select[#, NonNegative] &,
Negative
}]
slist == funkySort[slist[[RandomPermutation[Length[slist]]]]]
slist1 == funkySort[slist1[[RandomPermutation[Length[slist1]]]]]
slist2 == funkySort[slist2[[RandomPermutation[Length[slist2]]]]]
True
True
True
answered yesterday
MikeY
2,162410
EDITED TO FIX ERROR COPYING OVER FUNCTION
For the data sets, you are sorting on
- the number of negative numbers first, then
- the subset of just the nonnegative elements (using canonical ordering for lists), then
- the binary term gained when you replace a negative term with a '1' and a nonnegative with a '0'
The canonical ordering otherwise
funkySort[list_]:= SortBy[list,{
Count[#, _?Negative] &,
Select[#, NonNegative] &,
Negative
}]
slist == funkySort[slist[[RandomPermutation[Length[slist]]]]]
slist1 == funkySort[slist1[[RandomPermutation[Length[slist1]]]]]
slist2 == funkySort[slist2[[RandomPermutation[Length[slist2]]]]]
True
True
True
answered yesterday
MikeY
2,162410
edited 18 hours ago
answered yesterday
MikeY
2,162410
answered yesterday
MikeY
2,162410
answered yesterday
MikeY
2,162410
2,162410
Butslist != funkySort[list]. Are you sure this works. It doesn't seem to work on my system. Do you get really getslist1andslist2when your function is applied to any random ordering of those lists.
– Hubble07
21 hours ago
Oops, copied over the wrongfunkySort[ ]from my notebook. Fixed it...
– MikeY
18 hours ago
add a comment |
Butslist != funkySort[list]. Are you sure this works. It doesn't seem to work on my system. Do you get really getslist1andslist2when your function is applied to any random ordering of those lists.
– Hubble07
21 hours ago
Oops, copied over the wrongfunkySort[ ]from my notebook. Fixed it...
– MikeY
18 hours ago
But
slist != funkySort[list] . Are you sure this works. It doesn't seem to work on my system. Do you get really get slist1 and slist2 when your function is applied to any random ordering of those lists.– Hubble07
21 hours ago
But
slist != funkySort[list] . Are you sure this works. It doesn't seem to work on my system. Do you get really get slist1 and slist2 when your function is applied to any random ordering of those lists.– Hubble07
21 hours ago
Oops, copied over the wrong
funkySort[ ] from my notebook. Fixed it...– MikeY
18 hours ago
Oops, copied over the wrong
funkySort[ ] from my notebook. Fixed it...– MikeY
18 hours ago
add a comment |
draft saved
draft discarded
Thanks for contributing an answer to Mathematica Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f188839%2ffunction-for-sortby%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
4
Explain the core idea behind your sorted list. It certainly isn't clear what you're seeking.
– David G. Stork
yesterday
2
Can you give some examples with more complicated data?
– MikeY
yesterday
1
@MikeY I have added 2 more sorted sets.
– Hubble07
yesterday
So if you sort your data like this, it can probably be counted and therefore indexed in closed form.
– MikeY
15 hours ago
@MikeY Yes I have decided to use this sorting. I have edited by bounty question. If you have time then you could answer that, then I can gladly give you the bounty.
– Hubble07
8 hours ago