C#常用排序和查找算法

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
    }
}
时间: 2024-10-13 08:51:56

C#常用排序和查找算法的相关文章

排序和查找算法的使用

TBOX提供了各种常用算法,对容器中的元素进行各种操作,这里主要介绍下排序和查找算法. 排序算法目前支持如下几种: 快速排序:tb_quick_sort 堆排序: tb_heap_sort 插入排序:tb_bubble_sort 冒泡排序:tb_insert_sort 并且提供通用的tb_sort接口,对各种排序算法进行自动适配,使得任何情况下,性能都是最优的. 例如: 对具有随机迭代特性的容器,采用库快速排序来优化 对具有随机迭代特性,并且是超大规模的容器,采用堆排序 对只能线性迭代的容器采用

所有的排序、查找算法

import javax.mail.Part; /** * 顺序查找.排序 * * @author 曾修建 * @version 创建时间:2014-7-30 下午04:15:10 */ public class SequentialSearch { public static void main(String[] args) { Integer[] a = {1,2,3,4,5,7,6,88}; //二分查找非递归 System.out.println( "二分查找非递归实现 位置 : &qu

常用的排序、查找算法的时间复杂度和空间复杂度

常用的排序算法的时间复杂度和空间复杂度 排序法 最差时间分析 平均时间复杂度 稳定度 空间复杂度 冒泡排序 O(n2) O(n2) 稳定 O(1) 插入排序 O(n2) O(n2) 稳定 O(1) 选择排序 O(n2) O(n2) 稳定 O(1) 二叉树排序 O(n2) O(n*log2n) 不一顶 O(n) 快速排序 O(n2) O(n*log2n) 不稳定 O(log2n)~O(n) 堆排序 O(n*log2n) O(n*log2n) 不稳定 O(1) 希尔排序 O O 不稳定 O(1) 查

排序、查找算法

1> 插入排序 //插入排序(把第一个当作也排好序,然后对后面的依次插入到已排好序的队列中)平均时间复杂度0(n^2) public void insertSort(int[] a){ for(int i = 1;i<a.length;i++){ for(int j = i;j > 0;j--){ if(a[j] < a[j-1]){ int tmp = a[j]; a[j] = a[j-1]; a[j-1] = tmp; } } } } 2> 希尔排序 /*希尔排序:平均时

常用排序,查找,树算法集锦

本文转载至  http://blog.csdn.net/zhangkongzhongyun/article/details/8080466 分类: c语言2012-10-17 11:16 275人阅读 评论(0) 收藏 举报 算法google 前面写了好些排序,红黑树,B 树算法的文章,还剩下查找这一大块没有写,查找相关的算法代码已经实现,但是却没有写查找算法日志的闲情了,只好先在这里放出代码来,以后有空有闲情再补上吧. 算法代码 Google 仓库:点击这里 已完成算法 排序 插入排序 希尔排

python 排序和查找算法

一.搜索 1.顺序查找 数据存储在具有线性或顺序关系的结构中时,可顺序访问查找 def sequential_search(ilist, item): pos = 0 while pos < len(ilist): if ilist[pos] == item: return pos else: pos = pos + 1 return -1 2.二分查找 对于有序顺序表可使用二分查找,每次从中间项开始,故每次可以排除剩余项的一半 def binary_search(ilist, item): f

【排序和查找算法】

快速排序 插入排序 冒泡排序 归并排序

Java常用排序算法+程序员必须掌握的8大排序算法+二分法查找法

Java 常用排序算法/程序员必须掌握的 8大排序算法 本文由网络资料整理转载而来,如有问题,欢迎指正! 分类: 1)插入排序(直接插入排序.希尔排序) 2)交换排序(冒泡排序.快速排序) 3)选择排序(直接选择排序.堆排序) 4)归并排序 5)分配排序(基数排序) 所需辅助空间最多:归并排序 所需辅助空间最少:堆排序 平均速度最快:快速排序 不稳定:快速排序,希尔排序,堆排序. 先来看看 8种排序之间的关系: 1.直接插入排序 (1)基本思想:在要排序的一组数中,假设前面(n-1)[n>=2]

Java学习 (七)、数组,查找算法,二分查找法,冒泡排序,选择排序,插入排序

一.常用数组查找算法 工作原理:它又称为顺序查找,在一列给定的值中进行搜索,从一端的开始逐一检查每个元素,知道找到所需元素的过程. 例1:查找指定的数在数组中出现的位置,找到返回下标,找不到返回-1 1 import java.util.Scanner; 2 public class LinearSearch{ 3 public static void main(String []argas) 4 { 5 int [] array={10,100,90,65,80,92}; 6 System.o