合并两个有序数组并排序

最新推荐文章于 2024-05-16 09:00:00 发布

Moyunxingyue

最新推荐文章于 2024-05-16 09:00:00 发布

阅读量866

点赞数

本文链接：https://blog.csdn.net/Moyunxingyue/article/details/65938985

版权

        /// <summary>
        /// 合并两个有序数组并排序
        /// </summary>
        public static int[] CombineSort(int[] arrA,int[] arrB)
        {
            //排序
            for (int i = 0; i < arrA.Length - 1; i++)
            {
                for (int j = i; j < arrA.Length; j++)
                {
                    if (arrA[i] > arrA[j])
                    {
                        int temp = arrA[i];
                        arrA[i] = arrA[j];
                        arrA[j] = temp;
                    }
                }
            }
            //排序
            for (int i = 0; i < arrB.Length - 1; i++)
            {
                for (int j = i; j < arrB.Length; j++)
                {
                    if (arrB[i] > arrB[j])
                    {
                        int temp = arrB[i];
                        arrB[i] = arrB[j];
                        arrB[j] = temp;
                    }
                }
            }

            int[] arrNew = new int[arrA.Length + arrB.Length];
            int newIndex = 0;
            int bIndex = 0;

            for (int i = 0; i < arrA.Length; i++)
            {
                if (arrA[i] <= arrB[bIndex])
                {
                    arrNew[newIndex++] = arrA[i];
                }
                else
                {
                    int currStart = bIndex;
                    for (int k = currStart; k < arrB.Length; k++)
                    {
                        if (arrB[k] <= arrA[i])
                        {
                            arrNew[newIndex++] = arrB[k];
                            bIndex++;
                        }
                        else
                            break;
                    }
                    arrNew[newIndex++] = arrA[i];
                }

                if (bIndex == arrB.Length)
                {
                    for (int j = i + 1; j < arrA.Length; j++)
                    {
                        arrNew[newIndex++] = arrA[j];
                    }
                    break;
                }

                if (i == arrA.Length - 1)
                {
                    int currStart = bIndex;
                    for (int k = currStart; k < arrB.Length; k++)
                    {
                        arrNew[newIndex++] = arrB[k];
                        bIndex++;
                    }
                    break;
                }
            }
            return arrNew;
        }