Search - n2-1 - CodeBus

Search - n2-1 - List

[CSharp] BubbleSorter DL : 0: Bubble sort has worst-case and average complexity both О(n2), where n is the number of items being sorted. There exist many sorting algorithms with substantially better worst-case or average complexity of O(n log n). Even other О(n2) sorting algorithms, such as insertion sort, tend to have better performance than bubble sort. Therefore, bubble sort is not a practical sorting algorithm when n is large.
Date : 2026-01-09 Size : 1kb User : Mahmoud
[CSharp] dayin DL : 0: 编写螺旋方阵。其中螺旋方阵形式如下： 1 12 11 10 2 13 16 9 3 14 15 8 4 5 6 7 设row,column分别代表行、列坐标，变量p从1到n2将p依次存入数组a[row][column]中，要确定row、colomn的变化情况。分析如下：引进变量k，初值为n。当数据存入到左下角或右上角时，k减1，这样可保证输出时方阵。引进变量t，初值为1，当数据存入到右下角时，令t改变符合，当存入到左上角时，t又改变符合，这样可保证赋值到正确的数组坐标。 -Write spiral square. Square spiral form which is as follows: 1 12 1,110,213,169,314,158,456 7 set row, column representing the row, column coordinates, the variable p p from 1 to n2 will turn into an array a [row] [column], we must determine the row, colomn changes. As follows: the introduction of variable k, the initial value is n. When the data stored in the lower left or upper right corner when, k by 1, it will ensure that the output matrix. The introduction of variable t, the initial value is 1, when the data stored in the lower right corner, have resulted in changes consistent with t, the time when the deposit to the upper left corner, t and changing the match, it will ensure that the correct assignment to the array of coordinates.
Date : 2026-01-09 Size : 10kb User : 王一帆
[CSharp] 5 DL : 0: 选择排序（Selection sort）、插入排序（Insertion sort）与气泡排序（Bubble sort）这三个排序方式是初学排序所必须知道的三个基本排序方式，它们由于速度不快而不实用（平均与最快的时间复杂度都是O(n2)），然而它们排序的方式确是值得观察与探讨的。-Selection Sort (Selection sort), insertion sort (Insertion sort) and bubble sort (Bubble sort) three sort sort beginner needs to know three basic sort, they are not practical due to the slow speed (average and fastest the time complexity is O (n2)), but they sort of way is really worth watching and exploring.
Date : 2026-01-09 Size : 12kb User : 王硕
[CSharp] 6 DL : 0: 快速排序法（quick sort）是目前所公认最快的排序方法之一（视解题的对象而定），虽然快速排序法在最差状况下可以达O(n2)，但是在多数的情况下，快速排序法的效率表现是相当不错的。快速排序法的基本精神是在数列中找出适当的轴心，然后将数列一分为二，分别对左边与右边数列进行排序，而影响快速排序法效率的正是轴心的选择。 -Quick sort (quick sort) is currently recognized as one of the fastest sorting method (depending on the object of solving problems may be), although quick sort in the worst conditions you can reach O (n2), but in most cases efficient performance of quick sort is quite good. The basic spirit of the quick sort is to identify the appropriate number of columns in the axis, then the number of columns is divided into two, respectively, of the left and right columns are sorted, and the impact efficiency is quickly sort the selection axis.
Date : 2026-01-09 Size : 11kb User : 王硕
[CSharp] try11 DL : 0: 冒泡排序经典算法计算复杂度 O（N2） VOID MAIN函数包括 -Classic bubble sort algorithm complexity of O (N2) VOID MAIN functions include
Date : 2026-01-09 Size : 2kb User : yangxintong
[CSharp] try14 DL : 0: try14文件描述: 选择排序经典算法计算复杂度 O（N2） VOID MAIN函数包括 -try14 File Description: Sort classical algorithm complexity O (N2) VOID MAIN functions include
Date : 2026-01-09 Size : 21kb User : yangxintong
[CSharp] try15 DL : 0: try15 插入排序经典算法计算复杂度 O（N2） VOID MAIN函数包括 -try15 insertion sort algorithm classical computational complexity O (N2) VOID MAIN functions include
Date : 2026-01-09 Size : 42kb User : yangxintong