blocks|key|4917352|text|由于您希望2D数组按行排序，这恰好是多维数组在C中存储的顺序，因此您可以假设它是一个一维数组，并以这种方式对其排序。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4917353|假设您有一个函数void+sort(int[],+int+size);，它接受指向一维数组的第一个元素及其大小的指针，您可以这样做|offset|length|style|CODE|4917354|int+a[3][3]+=+{{4,6,1},+{3,2,9},+{5,7,8}};
sort(&a[0][0],+9);|code-block|syntax|javascript|4917355|当然，这只适用于真正的二维数组，而不适用于指针数组，这就是动态分配的二维数组通常是如何用C语言实现的。|4917356|entityMap^0|0|8|R|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|R|8|@$D|S|E|T|F|G]]|9|@]|A|$]]|$1|H|3|I|5|J|7|U|8|@]|9|@]|A|$K|L]]|$1|M|3|N|5|6|7|V|8|@]|9|@]|A|$]]|$1|O|3|-4|5|6|7|W|8|@]|9|@]|A|$]]]|P|$]]

Since you want your 2D array to be sorted row-wise, which happens to be the order in which multidimensional arrays are stored in C, you could pretend it is a 1D array and sort it that way.

Assuming you have a function <code>void sort(int[], int size);</code> that takes a pointer to the first element of a 1D array and its size, you could do

<pre><code>int a[3][3] = {{4,6,1}, {3,2,9}, {5,7,8}};
sort(&amp;a[0][0], 9);
</code></pre>

Naturally, this only works for true 2D arrays, not for arrays of pointers, which is how dynamically allocated 2D arrays are often implemented in C.

blocks|key|1250878|text|如果您将内存分配为常规的多维声明，则可以使用几乎相同的函数……因为多维数组是逐行存储在内存中的，而每一行只是一个规则数组。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1250879|只需将矩阵第一个元素的地址(通常为name_of_the_matrix[0])和矩阵中元素的数量传递给函数即可。|offset|length|style|CODE|1250880|希望我能帮上忙。|1250881|entityMap^0|0|H|L|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|M|8|@$D|N|E|O|F|G]]|9|@]|A|$]]|$1|H|3|I|5|6|7|P|8|@]|9|@]|A|$]]|$1|J|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|K|$]]

You can use pretty much the same function, if you are allocating the memory as a regular multi-dimensional declaration... Since multi-dimensional arrays are stored in memory row after row and each row is just a regular array.

Just pass to the function the address of the first element of the matrix (usually <code>name_of_the_matrix[0]</code>) and the number of elements in the matrix.

Hope I could help.

blocks|key|4917405|text|您可以使用Bubble-Sort：Wikipedia并使用for循环遍历数组。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|4917406|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Bubblesort^0|H|9|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

you can use Bubble-Sort: <a href="http://en.wikipedia.org/wiki/Bubblesort" rel="nofollow">Wikipedia</a> and go through the array with a for-loop.

blocks|key|1250949|text|基本思想是根据单元格的顺序对数组进行排序，因此您需要有一种方法来根据单元格的顺序获取单元格，以及一种根据单元格的顺序来编写单元格的方法。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1250950|int+getCellOrder(int+x,+int+y)+{
+++return+x*(x_width)+%2B+y;
}

int+getXpos(int+cellOrder)+{
+++return+cellOrder+/+x_width;
}

int+getYpos(int+cellOrder)+{
+++return+cellOrder+%25+x_width;
}|code-block|syntax|javascript|1250951|有了这两个元素，您现在可以获取数组的任意两个单元格顺序，以及它们引用的值。|1250952|int+valueAt(int+cellOrder)+{
+++return+array[getXpos(cellOrder)][getYpos(cellOrder];
}|1250953|如何比较订单和如何交换订单现在变成了一个简单的一维数组问题。|1250954|entityMap^0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Q|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|K|3|L|5|6|7|S|8|@]|9|@]|A|$]]|$1|M|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|N|$]]

The basic idea is to sort the array based on cell ordering, so you need to have a way to get a cell based on it's order and a way to write a cell based on it's ordering.

<pre><code>int getCellOrder(int x, int y) {
 return x*(x_width) + y;
}

int getXpos(int cellOrder) {
 return cellOrder / x_width;
}

int getYpos(int cellOrder) {
 return cellOrder % x_width;
}
</code></pre>

With those two elements, you can now grab any two cell orders for your array, and the values they reference.

<pre><code>int valueAt(int cellOrder) {
 return array[getXpos(cellOrder)][getYpos(cellOrder];
}
</code></pre>

How you compare the orders and how you swap them now becomes a simple 1D array problem.

blocks|key|1250971|text|您还可以采用C%2B%2B方法，并在以一维表示矩阵时执行以下操作：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1250972|#include+<vector>
#include+<algorithm>
using+namespace+std;

int+main(int+arg,+char+**argv)+{
++int+matrix[]+=+{4,+6,+1,+3,+2,+9,+5,+7,+8};
++vector<int>+matvec+(matrix,+matrix+%2B+sizeof(matrix)+/+sizeof(int));
++sort(matvec.begin(),+matvec.end());
++return+0;
}|code-block|syntax|javascript|1250973|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

You could also take the C++ approach and do the following while representing your matrix in 1D:

<pre><code>#include &lt;vector&gt;
#include &lt;algorithm&gt;
using namespace std;

int main(int arg, char **argv) {
 int matrix[] = {4, 6, 1, 3, 2, 9, 5, 7, 8};
 vector&lt;int&gt; matvec (matrix, matrix + sizeof(matrix) / sizeof(int));
 sort(matvec.begin(), matvec.end());
 return 0;
}
</code></pre>

blocks|key|3317236|text|假设你做了一个二维数组a和像我这样的元素，我这样做了：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3317237|for(i=0;i<row;i%2B%2B)
+for(j=0;j<col;j%2B%2B)
++for(k=0;k<row;k%2B%2B)
+++for(p=0;p<col;p%2B%2B)
++++++if(a[i][j]>a[k][p])
++++++temp=a[i][j];+a[i][j]=a[k][p];+a[k][p]=temp;|code-block|syntax|javascript|3317238|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

I made it like this given that you made an 2D array a[][] and the elements like me:

<pre><code>for(i=0;i&lt;row;i++)
 for(j=0;j&lt;col;j++)
 for(k=0;k&lt;row;k++)
 for(p=0;p&lt;col;p++)
 if(a[i][j]&gt;a[k][p])
 temp=a[i][j]; a[i][j]=a[k][p]; a[k][p]=temp;
</code></pre>

I am a newbie to C programming and was trying to prepare some sorting programs. I made the program of linear/ normal Sorting.

Now I want to make a program to sort 2D array.
i.e. If the matrix is

<pre><code>4 6 1
3 2 9
5 7 8
</code></pre>

Then the result should be

<pre><code>1 2 3
4 5 6
7 8 9
</code></pre>

Linear Sort of a 2D Array

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我是一个C编程新手，正在尝试编写一些排序程序。我编写了线性/正态排序的程序。现在我想编写一个程序来对二维数组进行排序。即，如果矩阵是4  6  13  2  95  7  8那么结果应该是1  2  34  5  67  8  9

问二维数组的线性排序
EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问二维数组的线性排序EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问二维数组的线性排序
EN