使用lambda对树进行排序

问题源自

http://topic.csdn.net/u/20100310/18/3768cc5a-a1ad-4190-a5b6-9185069150cf.html

 

最佳方案是建树并遍历。在sql中也有特殊方法。

 

从来都没见过用lambda解决这个问题，自己尝试了一下。只用了短短几行就能完成。虽然速度不算快（时间复杂度有O(n*n)），但足以说明lambda的强大！

注：上述时间复杂度指的是select操作的次数。并没有考虑排序和List的扩充等细节。

 

 namespace Test { public class Program { static void Main(string[] args) { var data = TestData.List; Func<List<int>, int, List<int>> add = (x, id) => { x.Insert(0, id); return x; }; Func<List<TestInfo>, int?, List<int>> sort = null; sort = (x, id) => { List<int> r = new List<int>(); var q = from i in x where i.ParentId == id orderby i.OrderId select add(sort(x, i.Id), i.Id); foreach (var item in q) { r.AddRange(item); } return r; }; var result = sort(data, null); foreach (var item in result) { Console.Write(item + " "); } /*2 3 5 8 4 9 1 7 6 10*/ } } public static class TestData { public static List<TestInfo> List = new List<TestInfo>() { new TestInfo() { Id = 1, ParentId = null, OrderId = 2 }, new TestInfo() { Id = 2, ParentId = null, OrderId = 1 }, new TestInfo() { Id = 3, ParentId = 2, OrderId = 1 }, new TestInfo() { Id = 4, ParentId = 2, OrderId = 3 }, new TestInfo() { Id = 5, ParentId = 2, OrderId = 2 }, new TestInfo() { Id = 6, ParentId = 1, OrderId = 2 }, new TestInfo() { Id = 7, ParentId = 1, OrderId = 1 }, new TestInfo() { Id = 8, ParentId = 5, OrderId = 1 }, new TestInfo() { Id = 9, ParentId = 2, OrderId = 4 }, new TestInfo() { Id = 10, ParentId = null, OrderId = 3 } }; } public class TestInfo { public int Id { get; set; } public int? ParentId { get; set; } public int OrderId { get; set; } } }