zoukankan      html  css  js  c++  java
  • 算法.冒泡和二分查找

    public static void SortOrder(int[] arrlist)
            {
                int temp;
                for (int i = arrlist.GetUpperBound(0); i >= 1; i--)
                {
                    for (int j = 0; j < arrlist.GetUpperBound(0) - 1; j++)
                    {
                        if (arrlist[j] > arrlist[j + 1])
                        {
                            temp = arrlist[j];
                            arrlist[j] = arrlist[j + 1];
                            arrlist[j + 1] = temp;
                        }

                    }
                }

            }

            public static int binarySearchBad(int[] arr, int value)
            {
                int low = 0, high = arr.Length - 1;
                int middle;
                while (low <= high)
                {
                    middle = (high +low) / 2;

                    if (value == arr[middle])
                    {
                        return middle;

                    }
                    if (value > arr[middle])
                    {
                        low = middle + 1;
                    }
                    if (value < arr[middle])
                    {
                        high = middle - 1;
                    }
                }
                return -1;
            }

  • 相关阅读:
    leveldb的搜索
    分布式存储bfs
    golang channel的行为
    支持rotate和大小限制的golang log库
    后台架构 一些需要注意的地方
    不要滥用面向对象,写出难以阅读和修改的代码
    goloader
    逻辑引擎、工作流、CMDB小感
    HTML5学习笔记4
    HTML5学习笔记3
  • 原文地址:https://www.cnblogs.com/cxlings/p/2773780.html
Copyright © 2011-2022 走看看