本文为您带来排序的英文翻译，包括排序用英语怎么说，排序用英语怎么说，排序的英语造句，排序的英文原声例

本文为您带来排序的英文翻译，包括排序用英语怎么说，排序用英语怎么说，排序的英语造句，排序的英文原声例句，排序的相关英语短语等内容。

排序的英文翻译，排序的英语怎么说？

排序的英语网络释义

排序（Sorting）是计算机程序设计中的一项重要操作，其功能是对于一个数据元素集合或序列重新排列成一个按数据元素某个项值有序的序列。

世界主要直流继电器产品技术水平评述 - 继电器 - 优领域 - 在优领域，找到您想要的！ 关键词：直流继电器；技术水平；排序[gap=901]Key words:DC relays; technical level; ranking

1排序 排序(ordering)是较高水平的比较，比较(comparing)是儿童根据某些具体特征或属性在两个或两组物品间建立关系，比较是排序的基础。

排序的汉英大词典

排序[pái xù]

• sort; seqencing; sorting; reorder; order; collate; rank
• 短语:
  • 排序程序 collator; collate program; sort; sequencer;
  • 排序机 collator;
  • 排序偏差 ordering bias;
  • 排序序列 {自} collating sequence;
  • 排序语句 an ordering statement;
  • 排序装置 collator; collating unit

排序的英语短语

排序的英文例句

他知道自己在排序中的位置。

He knew his place in the pecking order.

你的工作是把它们按字母编组，再把它们按数字顺序排序。

Your job is to group them by letter and put them in numerical order.

怎么对这些元素的左半部分排序呢？

How do I sort the left half of these elements?

如果你想让人们竞争，那就给他们排序。

If you want people to compete, rank them.

采用选择投票制，选民可在选票上根据喜好程度为候选人排序。

Under the alternative vote system, voters would be invited to rank candidates on the ballot in order of preference.

例如，目前还不清楚整个基因组的排序是否侵犯了其中单个基因组的专利权。

For example, it is unclear whether the sequencing of a whole genome violates the patents of individual genes within it.

这与选择排序形成了对比，在选择排序中，你一次又一次地完成寻找最小的元素。

This is in contrast to selection sort where you're fishing looking again and again for the smallest element.

对于应用程序，加载一个包含雇员数据的简单表；该表将支持对其任何列进行排序。

For the application, load a simple table with employee data; the table will support sorting on any of its columns.

事实上，随后的研究已经证实，元素不应该在元素周期表中被严格按照原子质量排序。

In fact, subsequent work has shown that in a periodic table, elements should not be ordered strictly by atomic mass.

我们对下面的图11进行了编辑，这样您就可以看到与排序溢出警报有关的所有问题。

We edited Figure 11 below, so you could see all the questions that are related to a spilled sort alert.

智力寻求的是理解、运用、重新排序和调整，而才智则是检查、思考、怀疑、理论化、批评和想象。

Intelligence seeks to grasp, manipulate, re-order, and adjust, while intellect examines, ponders, wonders, theorizes, criticizes and imagines.

虽然对大多数历史学家来说，根据重要性对历史原因进行排序的必要性似乎是显而易见的，但这种等级制度引发了严重的哲学难题。

While the need to rank historical causes in some order of importance may seem obvious to most historians, such hierarchies raise serious philosophical difficulties.

请帮忙把这些信件归类排序吧。

Please find the neighbors for the letters.

个人姓名也很少作为单位标记。例如，有时您可能希望根据名称进行搜索或排序，有时则希望根据姓氏进行搜索或排序。

A personal name is also rarely an atomic token. As an example, sometimes you may want to search or sort by a forename and sometimes by a surname.

二分法可以被定义为对弱排序的狄德金分割。

A dichotomy may be defined as a Dedekind cut for a weak ordering.

任何归一化常数都将被重新排序。

Any normalization constants will be rescaled.

这使用了二分法思想，利用双调序列，构造出了一种并行的排序算法：双调排序网络。

It constructs a kind of pallel sorting algorithm bitonic sorting net, taking advantage of dichotomy ideas and bitonic serial.

排序操作只能访问排序字段的值。

The sorting process only has to access the sort field's value.

它还执行选择、过滤和排序。

It also selects, filters, and sorts.

这是怎么样影响排序的？

How does this affect the ordering?

单击当前的排序图标。

Click on the current sorting icon.

我要如何对它排序？

How do I sort this?

第二个是根据默认排序算法排序的词汇列表。

The second sequence is the list of words sorted with the default sorting algorithm.

冒泡排序就是一种比较排序。

Bubble sort recall is a comparison sort.

排序是任何排序算法的核心。

A collation is the heart of any sorting algorithm.

排序：根据到固定点的距离对搜索结果进行排序。

Sorting: Sort the results for a search by the distance from some fixed point.

对需求排序。

Sort the requirements.

如果排序属性不是数字，那么结果应该按照字典次序排序。

If the order property is not numeric, then results should be sorted lexically.

如果没有设置排序参数，结果会按照相关性排序。

If sort parameters are not set, the results will be provided ordered by relevance.

注意，排序图标已经消失了，这表示没有执行排序。

Notice that the sorting icon has disappeared, indicating that no sorting is taking place.

排序的原声例句

You'll also notice that this thing goes through the entire list, even if the list is sorted before it gets partway through.

你也能注意到，它始终会遍历列表,甚至列表在排序之前,就是有序的也是这样。

Let's do selection and let's do merge sort here on the right just to see what actually happens.

中间进行选择排序，右边进行归并排序,看看会发生什么。

I haven't said how I'm going to get those sorted lists, but imagine I had two sorted lists like that.

我还没有说明我怎么才能得到已排序的列表,但是想像一下我现在已经有,两个已排序好序的列表了。

What's shown in this diagram is the progress of the developing embryo as it travels in time, down the fallopian tube.

这张图上显示的,就是胚胎发育的过程,是按照它在输卵管中移动的时间排序的

It has to be the atomic arrangement.

就是由于原子的排序。

So basically, at the time he was just going on size and then traits, but what we actually know today is that we can also order things in the periodic table by electron configuration.

基本上，在当时他只能通过大小,和特性来进行，但是现在我们已经知道了,我们还可以通过电子排布来对它们进行排序。

And this is in contrast to Selection Sort where you're fishing again and again for the then smallest element.

这与选择排序是相反的,在选择排序中你需要一次又一次地,找出最小的元素。

And so the fact that in this whole slide here, this algorithm for sorting, I'm using the verb sort.

在这个排序算法中,我用到了一个动词排序。

And that's the kind of instinct I'd like you to get into thinking about. So the answer here is no.

所以答案是否定的,好的，那我们能在线性时间内排序么？

If it was an unordered list, we were basically stuck with linear search. Got to walk through the whole list to see if the thing is there.

如果是一个未排序的列表,基本上我们就只能使用线性搜索了,通过遍历整个列表来查看。

I'm gonna tell you go sort the left, go sort the right, and then I'll merge the two together.

那先对左半部分排序，再对右半部分排序，然后将两者合并起来。

It implies that this algorithm is calling itself again and again, and again, and on each time the size of the problem I'm trying to sort is being divided by what?

这就说明此算法会一次又一次地调用自己,每次我要排序的问题规模大小,会除以多少呢？

Just contrast this for a brief moment to something like Selection Sort which from the get go had a ridiculous amount of redundancy comparing the same damn numbers again and again, and again.

这就与其他的排序算法形成了鲜明的对比,比如选择排序,它会一次又一次地做,多余的比较。

And in fact, if we count up all of these silly comparisons I was making verbally I bet I'm gonna be making fewer in the end than I was with bubble or with selection.

事实上，如果将所有的,比较次数加起来，我敢打赌,比起冒泡和选择排序,它最终的比较次数是相对较少的。

I hope you can see this because I'm going to try and simulate what a merge sort does. I've got eight things I want to sort here, and those initially start out here at top level.

我希望你们认真看,因为我要尝试着模拟出归并排序的操作过程,这里我有八个元素进行排序,第一步是将它们分成两半，对吗？

Merge sort takes this idea of divide and conquer, and it does the following: it says let's divide the list in half.

归并排序以如下的步骤使用了分治思想：,把列表分成两半：,下面就是分治。

Let's check it out. I've written a little bit of a test script here, so if we test cell sort, and I've written this so that it's going to print out what the list is at the end of each round, OK.

我们来检查检查，我写了一个小测试脚本,我写这个脚本来测试单元排序，它能够打印出每一轮结束后,链表的是什么样子的。

Alright, so bubble of sorts of course is being poked fun at there for what reasons?

冒泡排序在这儿显然是被拿来开玩笑了,那么原因是什么呢？

We looked at something called Selection Sort and that too was pretty straightforward, at least conceptually.

例如选择排序,至少从概念上来说，它非常简单。

And this is where it feels like we're not really doing anything except talking about sorting.

在这儿,似乎我们并没真正做什么而只是,在空谈排序。

So this is a nice little search-- sorry, a nice little sort algorithm . And in fact, it's relying on something that we're going to come back to, called the loop invariant.

恩，这是一个很棒的小搜索，抱歉，和很棒的小排序算法，事实上，它依赖于一些我们要回顾的东西,被称作循环不变量。

Run merge sort on those. By induction, if it does the right thing, I'm going to get back two lists, and I'm going to then merge Them together. Notice what I'm going to do.

在这些上面再运行归并排序，根据归纳，如果这样是正确的,我将重新得到两个列表,然后我会把它们合并在一起。

And what does that say? It says, let's assume I want to do k searches of a list. OK.

如果我们假定要在列表中做k次搜索,在线性的情况下，假定是一个未排序的情况。

We're gonna focus on this line in particular and ask ourselves how do you sort the left half.

我们应该集中于这一行,并自问一下该如何对左半部分排序。

OK, what I would like you to see is I've been printing out, as I went along, actually let's back up slightly and look at the code. There's merge sort.

好的，我想让你们看就是我运行过后,打印出来的结果，我们再回头看一下这段代码,这就是归并排序，输入一个列表。

As soon as I return, I get to resume this story which means sort the right half, so that means sort this half here.

一旦返回，就应该,对右半部分排序，也就是说对这边的一半进行排序。

So this plus plus is sort of shorthand notation for incrementation. So just add 1 to this variable's value, so now socks on feet is of course 1 and so next.

那么这个++符号是递增排序的,所以仅仅是对这个变量加一，现在袜子在脚上是一，那么下一个也是这样。

Now, I'll do this a bit more on automatic pilot so that it doesn't get too tedious, but let's do the same thing.

现在我可以熟练地进行排序,所以不会太沉闷，下面进行同样的步骤。

They are computationally challenged, meaning, at the time they were invented, they were perfectly good sorting algorithms, there are better ones, we're going to see a much better one next time around, but this is a good way to just start thinking about how to do the algorithm, or how to do the sort.

他们是相当棒的排序算法，是有更好的算法，我们下一次,就会看一个更好的，但是开始想想,如何完成算法，或者说是如何排序,是一个好的学习方法,恩，再试试吧,如何来排序呢？

Well, we saw the teaser in terms of that animation that suggests this merge sort algorithm when implemented by a computer is absolutely faster.

我们从前面的动画中可以看到,这个归并排序算法在计算机上实现之后,绝对比其他算法更快。

排序的网络释义

排序 排序是计算机内经常进行的一种操作，其目的是将一组“无序”的记录序列调整为“有序”的记录序列。分内部排序和外部排序，若整个排序过程不需要访问外存便能完成，则称此类排序问题为内部排序。反之，若参加排序的记录数量很大，整个序列的排序过程不可能在内存中完成，则称此类排序问题为外部排序。内部排序的过程是一个逐步扩大记录的有序序列长度的过程。

以上关于排序的英语翻译来自英汉大词典，希望对您学习排序的英语有帮助。