12,673
回編集
差分
ナビゲーションに移動
検索に移動
編集の要約なし
==マージソート==
[[VC++.NET]]{{category ロジック}}
VC++.NET 2005
static void marge( array<<String^>>^ ary, array<<String^>>^ ary1, array<<String^>>^ ary2 ) {
int i = 0;
int j = 0;
int k = 0;
while(i < < ary1->>Length && j < < ary2->>Length ) { if ( ary1[i]->>CompareTo(ary2[j]) < < 0 ) {
ary[k++] = ary1[i++];
} else {
}
}
while(i < < ary1->>Length ) {
ary[k++] = ary1[i++];
}
while(j < < ary2->>Length ) {
ary[k++] = ary2[j++];
}
}
static void margeSort( array<<String^>>^ ary ) {
if (ary->>Length > > 1) { int m = ary->>Length / 2; int n = ary->>Length - m; array<<String^>>^ a1 = gcnew array<<String^>>(m); array<<String^>>^ a2 = gcnew array<<String^>>(n);
for (int i=0; i<<m; i++) {
a1[i] = ary[i];
}
for (int i=0; i<<n; i++){
a2[i] = ary[m + i];
}
}
static void sort( array<<String^>>^ ary ) {
margeSort(ary);
}
static void print( array<<String^>>^ ary ) {
for (int i=0; i<<ary->>Length; i++) {
Console::WriteLine(ary[i]);
}
}
int main(array<<System::String ^> > ^args)
{
while ( (line = Console::ReadLine()) != nullptr ) {
list->>Add(line);
}
array<<String^>>^ ary = gcnew array<<String^>>(list->>Count); list->>CopyTo(ary, 0);
sort(ary);
© 2006 矢木浩人
