{"id":8831,"date":"2022-09-15T19:18:30","date_gmt":"2022-09-15T13:48:30","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/"},"modified":"2022-09-15T19:18:30","modified_gmt":"2022-09-15T13:48:30","slug":"solved-how-would-i-approach-sorting-something-like-this","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/","title":{"rendered":"[Solved] How would I approach sorting something like this"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-49901611\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"49901611\" data-parentid=\"49802283\" data-score=\"0\" data-position-on-page=\"1\" data-highest-scored=\"1\" data-question-has-accepted-highest-score=\"1\" itemprop=\"acceptedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>Here is how you would do that without using a Treeview (why wouldn&#8217;t you I don&#8217;t know):<\/p>\n<pre><code>void Main()\n{\n    string values = @\"1\n  14\n    141\n        141010\n        141020\n        141030\n        141040\n        141050\n        141060\n    142\n        142010\n        142020\n    144\n       1440\n          144010\n          144020\n          144030\n          144040\n    145020\n    145030\n    145010\n          \";\n\n    int myValue;\n\/\/ Splitting and converting to a collection of integers ordered by randomly\n\/\/ just to show initial order doesn't matter\n    var myData = values.Split(\"\\r\\n\".ToCharArray(), StringSplitOptions.RemoveEmptyEntries)\n        .Select(s =&gt; int.TryParse(s.Trim(), out myValue) ? myValue : -1)\n        .Where(n =&gt; n != -1)\n        .OrderBy(n =&gt; Guid.NewGuid());\n\n\/\/ We have the collection. Sort it \"directory\" style\n    List&lt;string&gt; myList = new List&lt;string&gt;();\n    var list = myData.Select(d =&gt; d.ToString());\n    foreach (var v in myData)\n    {\n        myList.Add(Fullpath(v.ToString(), list));\n    }\n    var ordered = myList.OrderBy(l =&gt; l);\n\/\/ Write out the result intended\n    foreach (var element in ordered)\n    {\n        var levels = element.Count(e =&gt; e == \"https:\/\/stackoverflow.com\/\");\n        var value = levels &gt; 0 ? element.Remove(0, element.LastIndexOf(\"https:\/\/stackoverflow.com\/\") + 1) : element;\n        Console.WriteLine(\"\".PadLeft(levels, '\\t') + value);\n    }\n}\n\n\/\/ Get the full path for a value with ancestors\n\/\/ ie: 1\/14\/1440\/144010 is the full path for 144010\nprivate string Fullpath(string key, IEnumerable&lt;string&gt; list)\n{\n    List&lt;string&gt; paths = new List&lt;string&gt;();\n    for (int i = 1; i &lt;= key.Length; i++)\n    {\n        if (list.Any(v =&gt; key.Substring(0, i) == v))\n        {\n            paths.Add(key.Substring(0, i));\n        }\n    }\n    return string.Join(\"https:\/\/stackoverflow.com\/\", paths);\n}\n<\/code><\/pre>\n<p>Note that values are shuffled before starting to sort and this is what you get:<\/p>\n<pre><code>1\n  14\n    141\n      141010\n      141020\n      141030\n      141040\n      141050\n      141060\n    142\n      142010\n      142020\n    144\n      1440\n        144010\n        144020\n        144030\n        144040\n    145010\n    145020\n    145030\n<\/code><\/pre>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\"><\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved How would I approach sorting something like this <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] Here is how you would do that without using a Treeview (why wouldn&#8217;t you I don&#8217;t know): void Main() { string values = @&#8221;1 14 141 141010 141020 141030 141040 141050 141060 142 142010 142020 144 1440 144010 144020 144030 144040 145020 145030 145010 &#8220;; int myValue; \/\/ Splitting and converting to a collection &#8230; <a title=\"[Solved] How would I approach sorting something like this\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/\" aria-label=\"More on [Solved] How would I approach sorting something like this\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[324,353],"class_list":["post-8831","post","type-post","status-publish","format-standard","hentry","category-solved","tag-c","tag-vb-net"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] How would I approach sorting something like this - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] How would I approach sorting something like this - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] Here is how you would do that without using a Treeview (why wouldn&#8217;t you I don&#8217;t know): void Main() { string values = @&quot;1 14 141 141010 141020 141030 141040 141050 141060 142 142010 142020 144 1440 144010 144020 144030 144040 145020 145030 145010 &quot;; int myValue; \/\/ Splitting and converting to a collection ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-09-15T13:48:30+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] How would I approach sorting something like this\",\"datePublished\":\"2022-09-15T13:48:30+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/\"},\"wordCount\":54,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"c++\",\"vb.net\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/\",\"name\":\"[Solved] How would I approach sorting something like this - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2022-09-15T13:48:30+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] How would I approach sorting something like this\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] How would I approach sorting something like this - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] How would I approach sorting something like this - JassWeb","og_description":"[ad_1] Here is how you would do that without using a Treeview (why wouldn&#8217;t you I don&#8217;t know): void Main() { string values = @\"1 14 141 141010 141020 141030 141040 141050 141060 142 142010 142020 144 1440 144010 144020 144030 144040 145020 145030 145010 \"; int myValue; \/\/ Splitting and converting to a collection ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/","og_site_name":"JassWeb","article_published_time":"2022-09-15T13:48:30+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] How would I approach sorting something like this","datePublished":"2022-09-15T13:48:30+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/"},"wordCount":54,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["c++","vb.net"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/","url":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/","name":"[Solved] How would I approach sorting something like this - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-09-15T13:48:30+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-how-would-i-approach-sorting-something-like-this\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] How would I approach sorting something like this"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/8831","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=8831"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/8831\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=8831"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=8831"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=8831"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}