一些不同类型的阵列选择分类。 [英] SOME DIFFERENT KIND OF SELECTION SORTING OF ARRAY.

问题描述

请为DIS问题提供解决方案。


选择排序基于以下D IDEA：

选择最大的阵列元素并打开它最后一个阵列

元素提供了一张未提交的清单，其大小比我原来的价格还要小.B
原始列表。如果V再次重复这个步骤，将在未列出的D列表中显示V将

已经订购了大小为2的列表和未列出的N-2列表大小（N是D

总数ARRAY ELEMENTS）。当我们重复这个大小时，

未提供的列表成为一个，结果将是一个已分类的列表。


写一个程序C语言实现这个算法。

PLZ，给出一个简单的逻辑代码。

PLEASE PROVIDE ME D SOLUTION CODE FOR DIS PROBLEM.

SELECTION SORT IS BASED ON D FOLLOWING IDEA:
SELECTING D LARGEST ARRAY ELEMENT AND SWAPPING IT WITH THE LAST ARRAY
ELEMENT LEAVES AN UNSORTED LIST WHOSE SIZE IS I LESS THAN THE SIZE OF
ORIGINAL LIST. IF V REPEAT THIS STEP AGAIN ON D UNSORTED LIST V WILL
HAVE AN ORDERED LIST OF SIZE 2 AND UNORDERED LIST SIZE OF N-2(N IS D
TOTAL NUMBER OF ARRAY ELEMENTS).WHEN WE REPEAT THIS UNTIL THE SIZE OF
THE UNSORTED LIST BECOMES ONE, THE RESULT WILL BE A SORTED LIST.

WRITE A PROGRAM IN C LANGUAGE TO IMPLEMENT THIS ALGORITHM.
PLZ , GIVE A SIMPLE LOGICAL CODE.

推荐答案

ANSHUL写道：

ANSHUL wrote:

请提供解决问题的解决方案代码。


选择排序基于以下D的想法：

选择最大的阵列元素并用最后一个阵列进行交换

元素留下一张未包含的列表，其大小不超过

原始列表。如果V再次重复这个步骤，将在未列出的D列表中显示V将

已经订购了大小为2的列表和未列出的N-2列表大小（N是D

总数ARRAY ELEMENTS）。当我们重复这个大小时，

未提供的列表成为一个，结果将是一个已分类的列表。


写一个程序C语言实现这个算法。

PLZ，给出一个简单的逻辑代码。

PLEASE PROVIDE ME D SOLUTION CODE FOR DIS PROBLEM.

SELECTION SORT IS BASED ON D FOLLOWING IDEA:
SELECTING D LARGEST ARRAY ELEMENT AND SWAPPING IT WITH THE LAST ARRAY
ELEMENT LEAVES AN UNSORTED LIST WHOSE SIZE IS I LESS THAN THE SIZE OF
ORIGINAL LIST. IF V REPEAT THIS STEP AGAIN ON D UNSORTED LIST V WILL
HAVE AN ORDERED LIST OF SIZE 2 AND UNORDERED LIST SIZE OF N-2(N IS D
TOTAL NUMBER OF ARRAY ELEMENTS).WHEN WE REPEAT THIS UNTIL THE SIZE OF
THE UNSORTED LIST BECOMES ONE, THE RESULT WILL BE A SORTED LIST.

WRITE A PROGRAM IN C LANGUAGE TO IMPLEMENT THIS ALGORITHM.
PLZ , GIVE A SIMPLE LOGICAL CODE.

1.不要喊，这会伤到我的耳朵。

2.改写，你要我们完成你的作业。

1. don''t shout, it hurts my ears.
2. rephrased, you want us to perform your homework.

ANSHUL写道：

ANSHUL wrote:

请提供我解决方案

PLEASE PROVIDE ME D SOLUTION

[snipped其余的争吵]


按照惯例，所有大写文字都表示大喊大叫，所以将来，如果你想要帮助的话，
请不要这样做回复。


还提供您的课程讲师的电子邮件，以便我们可以节省您的麻烦并直接将答案邮寄给他/她。


说真的，这个小组不会为你做功课。尝试

至少部分尝试解决您的问题并发布您的代码

在这里我们将非常乐意为您提供帮助，但有了这种态度，

您可能不会得到任何有用的回复。

[snipped rest of the brawling]

By convention all uppercase text signifies shouting, so in future,
refrain from it if you want helpful responses.

Also provide the email of your course instructor, so that we may save
you the hassle and mail the answer to him/her directly.

Seriously though, this group won''t do your homework for you. Try
atleast a partial attempt at solving your problem and post your code
here and we''ll be more than happy to help you, but with this attitude,
you likely wont get any helpful responses.

" ANSHUL"写道：

"ANSHUL" writes:

选择排序基于以下D IDEA：

选择最大的阵列元素并使用最后一个阵列进行打开
ELEMENT离开了一张未提交的清单，其尺寸大小不超过原始清单上的b
原始清单。如果V再次重复这个步骤，将在未列出的D列表中显示V将

已经订购了大小为2的列表和未列出的N-2列表大小（N是D

总数ARRAY ELEMENTS）。当我们重复这个大小时，

未分类的列表成为一个，结果将是一个分类列表。

SELECTION SORT IS BASED ON D FOLLOWING IDEA:
SELECTING D LARGEST ARRAY ELEMENT AND SWAPPING IT WITH THE LAST ARRAY
ELEMENT LEAVES AN UNSORTED LIST WHOSE SIZE IS I LESS THAN THE SIZE OF
ORIGINAL LIST. IF V REPEAT THIS STEP AGAIN ON D UNSORTED LIST V WILL
HAVE AN ORDERED LIST OF SIZE 2 AND UNORDERED LIST SIZE OF N-2(N IS D
TOTAL NUMBER OF ARRAY ELEMENTS).WHEN WE REPEAT THIS UNTIL THE SIZE OF
THE UNSORTED LIST BECOMES ONE, THE RESULT WILL BE A SORTED LIST.

为什么你想让别人为你编写代码？什么将获得
？问题似乎就像一个问题一样明确，忽略了我怀疑你自己引入的失真。只有几个主要步骤：创建一个数组，填充数组（带有一组测试数据），

对数组进行排序，然后打印数组（到显示实际工作的那种）。如果

你在main中创建一个数组，你可以有三个函数，如上面建议的那样。您可能希望让sort函数调用其他函数 -

您的选择。最好（也）打印数组

，因为你已经填充了数据以查看填充是否有效。


如果你已经被教过递归，它可能有助于写出那种 -

如果不是你做的任何事情对你来说很自然。


如果你能'做完整件事，开始并发布代码，显示你有多远得到b
。

Why would you want someone else to write the code for you? What would be
gained? The question seems about as clear as a question can be, ignoring
what I suspect is the distortion you introduced yourself. There are just a
few main steps: create an array, fill the array (with a set of test data),
sort the array, and print the array (to show the sort actually worked). If
you create an array in main you could have three functions as suggested
above. You may want to have the sort function call additional functions -
its your choice. It would be a good idea to (also) print the array as soon
as you have it filled with data to see if the fill worked.

If you have been taught recursion, it might be helpful in writing the sort -
if not do it whatever way seems natural to you.

If you can''t do the whole thing, start and post code showing how far you
got.

这篇关于一些不同类型的阵列选择分类。的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！