• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号

C#常用排序和查找算法

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

1.C#堆排序代码

private static void Adjust (int[] list, int i, int m)
{
    int Temp = list[i];
    int j = i * 2 + 1;

    while (j <= m)
    {
        //more children
        if(j < m)
            if(list[j] < list[j + 1])
                j = j + 1;

        //compare roots and the older children
        if(Temp < list[j])
        {
            list[i] = list[j];
            i = j;
            j = 2 * i + 1;
        }
        else
        {
            j = m + 1;
        }
    }

    list [i] = Temp;
}
public static void HeapSort (int[] list)
{
    //build the initial heap
    for (int i = (list.Length - 1) / 2; i > = 0; i-)
        Adjust (list, i, list.Length - 1);

    //swap root node and the last heap node
    for (int i = list.Length - 1; i > = 1; i-)
    {
        int Temp = list [0];
        list [0] = list [i];
        list [i] = Temp;
        Adjust (list, 0, i - 1);
    }
}

2.快速排序

private static int Partition (int[] list, int i, int j)
{
    int Key = list [i];

    while (i < j)
    {
        //j to the left scan
        while (list [j] >= Key && i < j)
            j--;

        if(i< j)
            list [i++] = list [j];

        //i to the right scan
        while (list [i] <= Key && i < j)
            i++;

        IF (i < j)
            list [j--] = list[i];
    }

    list [i] = Key;
    return i;
}
public static void QuickSort (int[] list, int low, int high)
{
    if(low < high - 1)
    {
        int Key = Partition (list, low, high);
        QuickSort (list, low, Key - 1);
        QuickSort (list, Key + 1, high);
    }
}

3.冒泡排序

    public static void BubbleSort (int[] list)
    {
        for (int i = 0; i < list.Length; i++)
        {
            for (int j = 0; j < list.Length - i - 1; j++)
            {
                if(list [j] > list [j + 1])
                {
                    int Temp = list [j];
                    list [j] = list [j + 1];
                    list [j + 1] = Temp;
                }
            }
        }
    }

4.选择排序

public static void SelectSort (int[] list)
{
     for (int i = 0; i < list.Length; i++)
     {
         int min = i;
         for (int j = i + 1; j < list.Length; j++)
             if(list [j] < list [min])
                 min = j;

     if(min ! = i)
         {
             int Temp = list [min];
             list [min] = list [i];
             list [i] = Temp;
         }
     }
}

5.二分查找

public int FindPosition(int num, int[] arr)  
        {  
            int left = 0;  
            int right = arr.Length - 1;  


            while (left < right - 1)  
            {  
                if (arr[left] == num)  
                {  
                    return left;  
                }  
                if (arr[right] == num)  
                {  
                    return right;  
                }  


                int middle = (left + right) / 2;  
                if (num == arr[middle])  
                {  
                    return middle;  
                }  
                else if (num < arr[middle])  
                {  
                    right = middle;  
                }  
                else  
                {  
                    left = middle;  
                }  


            }  
            return -1;  
        } 

6.C#公历转农历

/// <summary>
/// LunDay 的摘要说明。
/// 用法说明
/// 直接调用即可,比较简单
/// </summary>
public class LunDay
{
    public LunDay()
    {
        //
        // TODO: 在此处添加构造函数逻辑
        //
    }
    //天干
    private static string[] TianGan = { "甲", "乙", "丙", "丁", "戊", "己", "庚", "辛", "壬", "癸" };

    //地支
    private static string[] DiZhi = { "子", "丑", "寅", "卯", "辰", "巳", "午", "未", "申", "酉", "戌", "亥" };

    //十二生肖
    private static string[] ShengXiao = { "鼠", "牛", "虎", "兔", "龙", "蛇", "马", "羊", "猴", "鸡", "狗", "猪" };

    //农历日期
    private static string[] DayName =   {"*","初一","初二","初三","初四","初五",
         "初六","初七","初八","初九","初十",
         "十一","十二","十三","十四","十五",
         "十六","十七","十八","十九","二十",
         "廿一","廿二","廿三","廿四","廿五",      
         "廿六","廿七","廿八","廿九","三十"};

    //农历月份
    private static string[] MonthName = { "*", "正", "二", "三", "四", "五", "六", "七", "八", "九", "十", "十一", "腊" };

    //公历月计数天
    private static int[] MonthAdd = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 };
    //农历数据
    private static int[] LunarData = {2635,333387,1701,1748,267701,694,2391,133423,1175,396438
        ,3402,3749,331177,1453,694,201326,2350,465197,3221,3402
        ,400202,2901,1386,267611,605,2349,137515,2709,464533,1738
        ,2901,330421,1242,2651,199255,1323,529706,3733,1706,398762
        ,2741,1206,267438,2647,1318,204070,3477,461653,1386,2413
        ,330077,1197,2637,268877,3365,531109,2900,2922,398042,2395
        ,1179,267415,2635,661067,1701,1748,398772,2742,2391,330031
        ,1175,1611,200010,3749,527717,1452,2742,332397,2350,3222
        ,268949,3402,3493,133973,1386,464219,605,2349,334123,2709
        ,2890,267946,2773,592565,1210,2651,395863,1323,2707,265877};
    /// <summary>
    /// 获取对应日期的农历
    /// </summary>
    /// <param name="dtDay">公历日期</param>
    /// <returns></returns>
    public string GetLunarCalendar(DateTime dtDay)
    {
        string sYear = dtDay.Year.ToString();
        string sMonth = dtDay.Month.ToString();
        string sDay = dtDay.Day.ToString();
        int year;
        int month;
        int day;
        try
        {
            year = int.Parse(sYear);
            month = int.Parse(sMonth);
            day = int.Parse(sDay);
        }
        catch
        {
            year = DateTime.Now.Year;
            month = DateTime.Now.Month;
            day = DateTime.Now.Day;
        }

        int nTheDate;
        int nIsEnd;
        int k, m, n, nBit, i;
        string calendar = string.Empty;
        //计算到初始时间1921年2月8日的天数:1921-2-8(正月初一)
        nTheDate = (year - 1921) * 365 + (year - 1921) / 4 + day + MonthAdd[month - 1] - 38;
        if ((year % 4 == 0) && (month > 2))
            nTheDate += 1;
        //计算天干,地支,月,日
        nIsEnd = 0;
        m = 0;
        k = 0;
        n = 0;
        while (nIsEnd != 1)
        {
            if (LunarData[m] < 4095)
                k = 11;
            else
                k = 12;
            n = k;
            while (n >= 0)
            {
                //获取LunarData[m]的第n个二进制位的值
                nBit = LunarData[m];
                for (i = 1; i < n + 1; i++)
                    nBit = nBit / 2;
                nBit = nBit % 2;
                if (nTheDate <= (29 + nBit))
                {
                    nIsEnd = 1;
                    break;
                }
                nTheDate = nTheDate - 29 - nBit;
                n = n - 1;
            }
            if (nIsEnd == 1)
                break;
            m = m + 1;
        }
        year = 1921 + m;
        month = k - n + 1;
        day = nTheDate;
        //return year+"-"+month+"-"+day;

        #region 格式化日期显示为三月廿四
        if (k == 12)
        {
            if (month == LunarData[m] / 65536 + 1)
                month = 1 - month;
            else if (month > LunarData[m] / 65536 + 1)
                month = month - 1;
        }

        //生肖
        calendar = ShengXiao[(year - 4) % 60 % 12].ToString() + "年 ";
        //天干
        calendar += TianGan[(year - 4) % 60 % 10].ToString();
        //地支
        calendar += DiZhi[(year - 4) % 60 % 12].ToString() + " ";

        //农历月
        if (month < 1)
            calendar += "闰" + MonthName[-1 * month].ToString() + "月";
        else
            calendar += MonthName[month].ToString() + "月";

        //农历日
        calendar += DayName[day].ToString() + "日";

        return calendar;

        #endregion
    }
}

鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
状态模式(state)C++实现发布时间:2022-07-13
下一篇:
C语言实现Linux下删除非空目录发布时间:2022-07-13
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap