WAS BEDEUTET 머지소트 AUF KOREANISCH
Hier klicken,
um die ursprüngliche Definition von «머지소트» auf Koreanisch zu sehen.
Hier klicken,
um die automatische Übersetzung der Definition auf Deutsch zu sehen.
Definition von 머지소트 im Wörterbuch Koreanisch
Merseyside Merge bedeutet, Daten in einer bestimmten Reihenfolge zusammenzuführen und zu kombinieren. Zum Beispiel werden die Informationen jedes Punktes in einer Datei in der richtigen Reihenfolge gespeichert. Eine Sortierung ist eine Art Sache, die das Sortieren von Informationen in eine vorgegebene Reihenfolge bedeutet. Daher ist Mergesort ein Verfahren zum Sortieren durch eine Kombination von Dateien unter Verwendung eines Computers, wie zum Beispiel das Sortieren eines Transaktionsbelegs für einen Tag durch eine Karte oder ein Band, indem es in einer vorbestimmten Reihenfolge für jeden Kunden angeordnet wird. 머지소트 머지란 ‘조합한다’는 뜻이며 일정한 순서로 되어 있는 데이터를 조합해서 하나로 하는 일을 말한다. 예를 들면, 각 지점의 정보를 1개의 파일로 순서를 붙이는 것 등이다. 또 소트란 분류의 뜻이며, 정보항목을 미리 정해진 일정한 순서가 되도록 정리하는 일을 말한다. 그러므로 머지소트란 컴퓨터를 사용하여 파일의 조합에 의해 분류하는 방법을 말한다.예를 들면 하루 동안의 거래 전표를 고객별로 정해진 순서로 늘어놓아 카드나 테이프에 의해 분류하는 일 등을 말한다.
Hier klicken,
um die ursprüngliche Definition von «머지소트» auf Koreanisch zu sehen.
Hier klicken,
um die automatische Übersetzung der Definition auf Deutsch zu sehen.
10 BÜCHER, DIE MIT «머지소트» IM ZUSAMMENHANG STEHEN
Entdecke den Gebrauch von
머지소트 in der folgenden bibliographischen Auswahl. Bücher, die mit
머지소트 im Zusammenhang stehen und kurze Auszüge derselben, um seinen Gebrauch in der Literatur kontextbezogen darzustellen.
1
Introduction to Algorithms
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.
2
High Performance Computing and Communications: Third ...
Third International Conference, HPCC 2007, Houston, USA, September 26-28, 2007, Proceedings Ronald Perrott. 32 processors 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Parallel Binary Merge Sort Block Bitonic Sort log(n) pages 32 ...
3
An Introduction to Programming with Mathematica® - 198페이지
These include selection sort, insertion sort, bubble sort, quick sort, heap sort, merge sort, and many others. We have already looked at a rather primitive list sorting algorithm in Section 6.4. In this section, we will develop an algorithm for merge ...
Paul R. Wellin, Richard J. Gaylord, Samuel N. Kamin, 2005
4
Encyclopedia of Computer Science and Technology: Volume 29 ...
Volume 29 - Supplement 14: Agent-Oriented Programming to Socio-Organizational Aspects of Expert System Design Allen Kent, James G. Williams. merge sorted list merge meree merge FIGURE 4 Merge sort tree.
Allen Kent, James G. Williams, 1993
5
C++: Object-Oriented Data Structures - 321페이지
file or as an array, merge sort needs such work areas as subfiles or arrays of the same size. Moreover, there are several methods of splitting the data file. Yet in merge sort, the split is easy and the merge is complex. But in quicksort, the split is ...
Saumyendra Sengupta, Carl P. Korobkin, 2012
6
Mastering Algorithms with C - 318페이지
The distinguishing component of merge sort is its merging process. This is the process that takes two sorted sets and merges them into a single sorted one. As we will see, merging two sorted sets is efficient because we need only make one ...
7
High Performance Computing: 4th International Symposium, ...
This paper introduces a new parallel merge sort scheme, called load-balanced parallel merge sort, that forces every processor to participate in merging at every iteration. Each processor deals with a list of size of about N/P at every iteration, ...
Hans P. Zima, Kazuki Joe, Mitsuhisa Sato, 2003
8
Encyclopedia of Algorithms - 294페이지
A typical merge sort algorithm works as follows [9]: In the “run formation” phase, the n blocks of data are scanned, one memoryload at a time; each memoryload is sorted into a single “run,” which is thenoutput onto a seriesof stripes on thedisks.
9
Big Java: Compatible with Java 5, 6 and 7 - 611페이지
Merge sort is an O(n log(n)) algorithm. The n log(n) function grows much more slowly than n2. Because n = 2m, we have m = log2(n). To establish the growth order, we drop the lower-order term n and are left with 5n log2(n). We drop the ...
10
Analysis of Algorithm and Design - 2-20페이지
2.5 Merge Soft The merge sort is a sorting algorithm that uses the divide and conquer strategy. In this method division is dynamically carried out. Merge sort on an input array with n elements consists of three steps: Divide : partition array into ...
