英语达人来帮忙翻译下！急！！！

Posted 2023-05-10

专业名词不会翻译的就空在那里，但其他的请完整的翻译出来哦！语句通顺，没语法错误就好！谢谢哦！！！

每个女孩子小时候，或多或少都穿过那么几件小碎花的衣服或裙子：松身，胸前有细细的褶，加上白色的彼得潘小圆领……蒙眬间青葱岁月的遥远记忆便一下子清晰起来。
长大以后，很长一段时间有意识地抗拒这样的穿着，因为这是妈妈最爱的乖乖女装扮，而我誓要和Little Lady（淑女）划清界限。然而骨子里是被这样的氛围和记忆熏陶大的，不是不喜欢，只是对于固有的收藏和对于未知的试验。
然后有一天，像是开启了祖母的旧箱子或是发现了神秘园，突然觉得小时候的记忆如同翻江倒海般地重生、复活。我发现自己对于各式各样的图案和纹样有着不可抑制的热情：刺绣纹样、腰果花、浮世绘以及各式小碎花……
直接用金山翻译工具或者GOOGLE翻译工具翻译过来的就不用发了，因为那个翻译的完全语句不通！！

every girl, when not grown up, wore clothes with small floral print somewhat. There were small wrinkles in front of the chest area, and with white Peterpan kind of round collar. All of a sudden， those obscure youth time are clearly presented.
when grown up, in order to avoid becoming my mother's goody-goody little girl, I resisted wearing such kind of clothes consciously, thus I was clear of little Lady, I thought. I was doing this not because of dislike, but that I was unwilling to be defined in such air and memory, all what I want was to recall and try.（这儿的recall翻的不太好,因为原文“对于固有的收藏”不太明白什么意思）
Then, one day, just like what I felt when I had opened the dated box of my grandma or the secret garden had been found, those memories of childhood sored into my mind, roaring and reviving. I found myself unrestrictly passionate to all sorts of patterns and textures, be they embroidery, cashew-like flowers, Yamato-e, or any kind of small floral print

觉得这样的文章，翻译文字的准确性远远没有真实表达元作者的感情那么重要
改了一些细节，是为了更好的表达这种心情 参考技术A Each girl was young, more or less through a few small碎花then clothes or dress: loose, pleated chest are thin, and small white T-Pan ... ... Mongolia眬the years between the green remote memory will clear up all of a sudden.
Grew up after a long period of time consciously resist wearing this, because this is my mother's favorite female dress, and I vow and Little Lady (Lady) make a clean break. But deep down is such a great atmosphere and the influence of memory, is not like it, just for the collection and the inherent uncertainties of the test.
Then one day, like opening a box or the old grandmother found a secret garden, suddenly felt like a child's memory翻江倒海like rebirth, resurrection. I find myself for a wide variety of designs and patterns can not be suppressed passion: embroidery patterns, cashew flowers, Ukiyo-e, as well as all kinds of small碎花... ... 参考技术B Each girl was young, more or less through a few small bad flower then clothes or dress: loose, pleated chest are thin, and small white T-Pan ... ... Mongolia the years between the green remote memory will clear up all of a sudden.

Grew up after a long period of time consciously resist wearing this, because this is my mother's favorite female dress, and I vow and Little Lady (Lady) make a clean break. But deep down is such a great atmosphere and the influence of memory, is not like it, just for the collection and the inherent uncertainties of the test.

   Then one day, like opening a box or the old grandmother found a secret garden, suddenly felt like a child's memory billows like rebirth, resurrection. I find myself for a wide variety of designs and patterns can not be suppressed passion: embroidery patterns, cashew flowers, Ukiyo-e, as well as all kinds of small bad flower... ... 参考技术C Every girl when I was young, more or less through so few small calico clothes or skirt: loose, chest, with white fine plait Peter roundlet brought... Bring the distant memory between youth and clear up quickly. Grow up, for a very long time consciously resist this dress, because this is the mother of love, and my darling female oath to them and are (Lady) drawn. But this is the deep influence of atmosphere and memory, not like, just for the collection and the inherent in unknown test. Then one day, like the old grandmother opened the box and found a mysterious garden, suddenly feel memories of childhood FanJiangDaoHai as somehing rebirth and resurrection. I found myself for various patterns and designs a quenchless enthusiasm: embroidery pattern, cashew, float world draw, and all kinds of small calico...

不知道行不行……有的是拼音哦·

高分求计算机英语翻译.急！！！！！

TYPICAL SORT PROBLEMS
Treesort
Treesort is a tow-step.Fist,the elements are inserted inserted into abinary search tree .Second,the elements are retrieved,in sorted order,using an inorder traversal.
A binary search tree is not an attractive aooroach to sorting because a heap does the same job with less effort.Tnstead of starting out by putting the elements in binary search tree, we begin by forming a heap.If,however,the elements are in a binary search tree,then aninorder traversal accesses them in sorted order withO(n) effort.
Mergesort
Two sublists,each already sorted,can bemerged together to form one aggregate list that is also sorted.Asimple and effective procedure for doing this,called mergesort,begins by comparing pairs of elements-one from each sublist.The smallest element is appended to a sorted list and is replaced by the next element from its sublist.The smallest element is appended to asorted list and is replaced by the next element from its sublist.This continues until there are no more elements in the other sublist are then appended to the sorted list,and the sort is complete
This sounds good when there are tow sorted sublists with which to begin. If thereare not, the problem is to decide how to et started.There are several possibilities.
One approach is to consider indiveidual elements as sorted sublists of length one.Pairs of these sublists are merged to produce sorted lists of length two.Pairs of these lists are then merged to produce sorted lists of length four.This process continues until only one sorted list remains.This process is illustrated in Fig.4-8.
Notice that mergesort requires tow arrays-r,which originally holda the data to be sorted,and t,an array of the same type,The merges are in pairs-first from r to t,then from t to r.Thus mergesort requires space for 2 × n elements.
是计算机英语翻译，不懂不要来！

TYPICAL SORT PROBLEMS
典型排序问题
Treesort 树排序
Treesort is a tow-step.Fist,the elements are inserted inserted into a binary search tree .Second,the elements are retrieved,in sorted order,using an inorder traversal.
A binary search tree is not an attractive aooroach to sorting because a heap does the same job with less effort.Tnstead of starting out by putting the elements in binary search tree, we begin by forming a heap.If,however,the elements are in a binary search tree,then aninorder traversal accesses them in sorted order withO(n) effort.
树排序是一种落后的方法。首先，其中的元素被嵌入一个二叉搜索树。其次，其中的元素又必须依次使用中序遍历来进行。而对于相同的工作量，堆排序消耗的资源比二叉树排序消耗的少得多。因此开始的时候，我们将元素构建一个堆而不是将其放入二叉树。尽管如此，如果元素已经在一个二叉树里了，那么花点功夫使用中序遍历将其排好序（withO(n) effort有可能是你打错了，我不清楚...）
Mergesort 归并排序
Two sublists,each already sorted,can bemerged together to form one aggregate list that is also sorted.Asimple and effective procedure for doing this,called mergesort,begins by comparing pairs of elements-one from each sublist.The smallest element is appended to a sorted list and is replaced by the next element from its sublist.The smallest element is appended to asorted list and is replaced by the next element from its sublist.This continues until there are no more elements in the other sublist are then appended to the sorted list,and the sort is complete
This sounds good when there are tow sorted sublists with which to begin. If thereare not, the problem is to decide how to et started.There are several possibilities.
One approach is to consider individual elements as sorted sublists of length one.Pairs of these sublists are merged to produce sorted lists of length two.Pairs of these lists are then merged to produce sorted lists of length four.This process continues until only one sorted list remains.This process is illustrated in Fig.4-8.
Notice that mergesort requires tow arrays-r,which originally holda the data to be sorted,and t,an array of the same type,The merges are in pairs-first from r to t,then from t to r.Thus mergesort requires space for 2 × n elements
将两个已经排好序的序列进行归并形成一个新的排好序的序列。一种被称为归并排序的方法就可以简单有效的实现这一过程。最开始的时候对每个序列中的两个元素两两进行比较。最小的那个被放到排好序的序列中并且其位置被序列中下一个元素所取代。（again?.....）这个过程一直持续到另一个序列中也没有元素进行归并操作了，然后将这个元素也添加进排好序的序列，排序完成。看起来当已经有两个排好序的序列的时候实现这种排序方法很方便，但当没有的时候，问题就成为了如何开始：有几种方法可以实现
一种方法是将单个的元素作为排好序的序列，其长度为一。两个这样的序列进行归并操作后就形成有序的长度为二的序列。两个长度二的序列在进行归并操作就形成长度为四的有序序列。这种过程一直持续到只有一个有序序列了为止。在图4-8中有说明。
注意到归并排序需要两个指针，array-r最初位置为已经排序序列的起始位置，array-t也是一样的。归并中开始时将r指向的值同t比（小的那个进排序序列了？），然后是t到r。因此归并排序需要对应N个元素申请2xN的空间

....不太懂啊 参考技术A 典型的排序问题treesort treesort是丝束step.fist ,内容是插入插入abinary搜索树. 第二,内容检索,在 排序顺序,使用一种inorder traversal . 二元搜索树不是一个有吸引力的aooroach来排序,因为一堆不相同的工作少 effort.tnstead入手,把元素二元搜索树 我们开始组建了一个由heap.if ,不过,内容是在一个二进制搜索树,然后遍历aninorder accesses他们在排序顺序 witho ( n )努力. mergesort两子,每一个已分类,可bemerged在一起,形成一个总的名单,这也是sorted.asimple和有效的程序 这样,所谓mergesort ,开始通过对比双分子--每个sublist.the最小单元附在排序名单 取而代之的是下个元素从其sublist.the最小单元附在asorted名单,取而代之的是 下个元素从其sublist.this继续,直到有没有更多的元素,在其他sublist然后附在 以分类表的排序是完成这听起来很好当有丝束sorted sublists历时 开始. 如果thereare ,问题是要决定如何et started.there有几种可能性. 一个办法是考虑indiveidual内容整理sublists长度one.pairs这些sublists合并产生 排序名单长度two.pairs这些名单,然后合并产生sorted lists长度four.this进程继续 直到一排序名单remains.this过程说明fig.4 - 8 . 公告说mergesort需要拖曳阵列r ,原本holda数据进行整理,并笔,数组的同一类型, merges 在双首由R至T ,然后从T到r.thus mergesort需要空间2 N个元素. 参考技术B 典型的种类问题
Treesort
Treesort 是拖-step.Fist, 元素被插入进入 abinary 搜寻树之内插入。其次，元素被取回,在分类的次序中,使用 inorder traversal。
一棵二进位的搜寻树不是吸引人的 aooroach 到分类因为堆用比较少的努力做相同的工作。藉由放二进位的搜寻树的元素开始出的 Tnstead,然而,我们从形成 heap.If 开始,元素是在一棵二进搜寻树中,然后 aninorder traversal 在分类的次序 withO(n) 努力中存取他们。
Mergesort
二本次目录,每个已经分类, 罐子 bemerged 一起形成一合计也被分类的目录。做这的 Asimple 和有效的程序,叫做了 mergesort,从比较元素的双开始- 一从每本次目录。最小的元素被附加到一本被分类的目录和是被来自它的次目录的下一种元素代替。最小的元素被附加到 asorted 目录和是被来自它的次目录的下一种元素代替。这直到没有另一个次目录的较多元素然后被附加到被分类的目录, 和种类是完全的
这一个声音善行何时有拖分类次目录该哪一开始。 如果 thereare 不，问题要决定如何到 et 开始。有一些可能性。
方式要把 indiveidual 元素视为长度的分类次目录一。这些次目录的双被合并生产分类长度二的目录。这些目录的双然后被合并生产分类长度四的目录。这一个程序直到只有一分类了目录残余物。这一个程序在 Fig.4-8 中被举例说明。
mergesort 需要拖排列-r 和 t ，相同的类型排列,合并是在从 r 到 t 的双- 第一中,然后从 t 到 r, 本来 holda 数据到被分类。如此 mergesort 需要提供 2种 × n 元素的空间。 参考技术C 典型的排序问题
Treesort
Treesort是拖曳步。元素插入拳头插入了入abinary查寻树。其次，元素按被排序的顺序被检索，使用inorder遍历。
因为堆做同一个工作以较少努力，一个二进制树形网络不是一有吸引力的aooroach到排序。Tnstead开始通过投入元素在二进制树形网络，我们通过形成堆开始。如果，然而，元素在一个二进制树形网络，则aninorder遍历访问他们在被排序的命令withO (n)努力。
Mergesort
二份子表，中的每一份已经被排序，罐头一起bemerged形成也被排序的一张聚集名单。Asimple和有效的方法为做此，称mergesort，通过比较对开始元素一从每份子表。最小的元素被添附对一张被排序的名单和被下个元素替换从它的子表。最小的元素被添附对asorted名单和被下个元素替换从它的子表。这继续联合国 参考技术D 典型的排序问题 Treesort Treesort 是拖曳step.Fist, 元素被插入插入了入abinary 查寻树Second, 元素被检索, 在被排序的次序,使用inorder 遍历。 一个二进制树形网络不是一有吸引力的aooroach对排序因为堆做同样工作与较少effort.Tnstead 开始由投入元素在二进制树形网络, 我们开始由形成heap.If, 然而, 元素是在一个二进制树形网络, 那么aninorder 遍历访问他们在被排序的命令withO(n) 努力。 Mergesort 二sublists, 每个已经被排序, 罐头一起bemerged 形成并且是sorted.Asimple 和有效的方法为做这的一张聚集名单, 叫做mergesort, 开始由比较对元素一从最小的元素被添附对一张被排序的名单的各sublist.The 并且由下个元素替换从最小的元素被添附对asorted 名单的它的sublist.The 并且由下个元素替换从它的sublist.This 继续直到有不没有其他元素在另一sublist 然后被添附对被排序的名单, 并且排序是完全的 这听起来好当有拖曳开始的被排序的sublists 。如果thereare 不是, 问题将决定怎么对和started.There 是几种可能性。 一种方法将indiveidual 元素把长度视为被排序的sublists one.Pairs 的这些sublists 被合并导致长度被排序的名单two.Pairs 的这些名单然后被合并导致长度four.This 过程被排序的名单继续直到只一个被排序的名单remains.This 过程被说明在Fig.4-8。 注意, mergesort 要求拖曳排列r, 最初holda 数据被排序, 和t, 同样型一一些, 合并是对第一从r 到t, 然后从t 到r.Thus mergesort 要求空间为2 个□n 元素。