. "Algorytm in situ (\u0142ac. in situ \u2013 w miejscu) \u2013 algorytm, kt\u00F3ry do wykonania potrzebuje sta\u0142ej ilo\u015Bci pami\u0119ci komputera, niezale\u017Cnej od rozmiaru danych wej\u015Bciowych. Wszelkie potrzebne do otrzymania wyniku obliczenia s\u0105 wykonywane w pami\u0119ci, do kt\u00F3rej zosta\u0142y za\u0142adowane dane. Algorytmy tego typu by\u0142y cenione nie tylko w czasach, kiedy komputery mia\u0142y ma\u0142o pami\u0119ci operacyjnej, lecz r\u00F3wnie\u017C obecnie, zw\u0142aszcza tam, gdzie przetwarza si\u0119 du\u017Ce ilo\u015Bci danych jak np. w obliczeniach numerycznych."@pl . . . . . "\u5728\u8BA1\u7B97\u673A\u79D1\u5B66\u4E2D\uFF0C\u4E00\u4E2A\u539F\u5730\u7B97\u6CD5\uFF08in-place algorithm\uFF0C\u4E5F\u79F0\u201C\u5C31\u5730\u7B97\u6CD5\u201D\uFF09\u662F\u57FA\u672C\u4E0A\u4E0D\u9700\u8981\u501F\u52A9\u989D\u5916\u7684\u6570\u636E\u7ED3\u6784\u5C31\u80FD\u5BF9\u8F93\u5165\u7684\u6570\u636E\u8FDB\u884C\u53D8\u6362\u7684\u7B97\u6CD5\u3002\u4E0D\u8FC7\uFF0C\u5206\u914D\u5C11\u91CF\u7A7A\u95F4\u7ED9\u90E8\u5206\u8F85\u52A9\u53D8\u91CF\u662F\u88AB\u5141\u8BB8\u7684\u3002\u7B97\u6CD5\u6267\u884C\u8FC7\u7A0B\u4E2D\uFF0C\u8F93\u5165\u7684\u6570\u636E\u5F80\u5F80\u4F1A\u88AB\u8F93\u51FA\u7ED3\u679C\u8986\u76D6\u3002\u539F\u5730\u7B97\u6CD5\u53EA\u80FD\u901A\u8FC7\u66FF\u6362\u6216\u4EA4\u6362\u5143\u7D20\u7684\u65B9\u5F0F\u6765\u4FEE\u6539\u539F\u59CB\u7684\u8F93\u5165\u3002\u4E0D\u6EE1\u8DB3\u201C\u539F\u5730\u201D\u539F\u5219\u7684\u7B97\u6CD5\u4E5F\u88AB\u79F0\u4E3A\u975E\u539F\u5730\uFF08not-in-place\uFF09\u7B97\u6CD5\u6216\u5F02\u5730\uFF08out-of-place\uFF09\u7B97\u6CD5\u3002 \u539F\u5730\u6709\u591A\u79CD\u4E0D\u540C\u7684\u542B\u4E49\u3002\u5728\u5176\u6700\u4E25\u683C\u7684\u5F62\u5F0F\u4E0B\uFF0C\u539F\u5730\u7B97\u6CD5\u53EA\u5141\u8BB8\u5360\u7528\u56FA\u5B9A\u5927\u5C0F\u7684\u989D\u5916\u7A7A\u95F4\uFF0C\u5176\u4E2D\u5305\u542B\u4E86\u51FD\u6570\u8C03\u7528\u548C\u6307\u9488\u5360\u7528\u7684\u7A7A\u95F4\u3002\u7136\u800C\uFF0C\u8FD9\u79CD\u5F62\u5F0F\u6709\u5F88\u5927\u7684\u5C40\u9650\u6027\uFF0C\u56E0\u4E3A\u4ED6\u8981\u6C42\u6307\u5411\u957F\u5EA6\u4E3A \u7684\u6570\u7EC4\u53EA\u80FD\u4F7F\u7528 \u4E2A\u6BD4\u7279\u4F4D\u3002\u800C\u66F4\u901A\u7528\u7684\u5F62\u5F0F\u8BA4\u4E3A\uFF0C\u539F\u5730\u610F\u5473\u7740\u7B97\u6CD5\u5728\u66F4\u6539\u8F93\u5165\u5185\u5BB9\u65F6\u4E0D\u9700\u8981\u989D\u5916\u7684\u7A7A\u95F4\uFF0C\u4F46\u662F\u53EF\u4EE5\u5728\u8FDB\u884C\u8FD9\u4E9B\u64CD\u4F5C\u65F6\u4F7F\u7528\u5C11\u91CF\u7684\u975E\u56FA\u5B9A\u5927\u5C0F\u7684\u7A7A\u95F4\u3002\u901A\u5E38\uFF0C\u8FD9\u90E8\u5206\u7A7A\u95F4\u590D\u6742\u5EA6\u4E3A \uFF0C\u4E0D\u8FC7\u67D0\u4E9B\u60C5\u51B5\u4E0B\u4EFB\u4F55\u6EE1\u8DB3 \u7684\u590D\u6742\u5EA6\u4E5F\u662F\u5141\u8BB8\u7684\u3002\u6CE8\u610F\u7A7A\u95F4\u590D\u6742\u5EA6\u5728\u662F\u5426\u5C06\u7D22\u5F15\u957F\u5EA6\u7EB3\u5165\u6B64\u989D\u5916\u7A7A\u95F4\u65B9\u9762\u4E5F\u662F\u6709\u591A\u79CD\u9009\u62E9\u7684\u3002\u5E38\u89C1\u7684\u8003\u91CF\u662F\u5C06\u7D22\u5F15\u7684\u6570\u91CF\u6216\u9700\u8981\u7684\u6307\u9488\u6570\u91CF\u7B97\u5230\u7A7A\u95F4\u590D\u6742\u5EA6\u5F53\u4E2D\u7684\u3002\u5728\u8FD9\u7BC7\u6587\u7AE0\u4E2D\uFF0C\u6211\u4EEC\u6240\u6307\u7684\u6574\u4F53\u7A7A\u95F4\u590D\u6742\u5EA6\uFF08\uFF09\u5C06\u6307\u9488\u957F\u5EA6\u8003\u8651\u5728\u5185\u4E86\u3002\u56E0\u6B64\uFF0C\u5206\u6790\u5BF9\u5E94\u7684\u5B58\u50A8\u7A7A\u95F4\u5360\u7528\u4F1A\u6BD4\u5FFD\u7565\u7D22\u5F15\u3001\u6307\u9488\u957F\u5EA6\u7684\u65B9\u6CD5\u591A\u4E00\u4E2A \u56E0\u5B50\u3002"@zh . . "In informatica un algoritmo si dice in loco oppure in place quando \u00E8 in grado di trasformare una struttura dati utilizzando soltanto un piccolo e costante spazio di memoria extra. I dati in ingresso sono solitamente sovrascritti con il risultato prodotto durante l'esecuzione dell'algoritmo. Un algoritmo \u00E8 a volte chiamato in modo informale in loco quando sovrascrive i suoi input con i suoi output. In realt\u00E0 questo non \u00E8 sufficiente (come dimostra il caso del quicksort) n\u00E9 \u00E8 necessario; la quantit\u00E0 di spazio occupato dall'output potrebbe essere costante, oppure potrebbe non essere nemmeno quantificabile, per esempio nel caso di output su stream. D'altro canto a volte potrebbe essere pi\u00F9 pratico quantificare lo spazio occupato dai risultati in output e determinare se l'algoritmo \u00E8 definibile come in loco, come si vede nell'esempio di rovesciamento sottostante. Gli algoritmi in loco sono pi\u00F9 efficienti in termini di memoria e, spesso, anche in termini di CPU, rispetto alle controparti non in loco e tendono quindi ad essere preferiti rispetto a questi ultimi."@it . . . . . . "In-place algoritmus"@cs . . . . "In-place algorithm"@en . . "1120616738"^^ . . . "In computer science, an in-place algorithm is an algorithm which transforms input using no auxiliary data structure. However, a small amount of extra storage space is allowed for auxiliary variables. The input is usually overwritten by the output as the algorithm executes. An in-place algorithm updates its input sequence only through replacement or swapping of elements. An algorithm which is not in-place is sometimes called not-in-place or out-of-place."@en . "Algorytm in situ"@pl . . "in-place\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3068\u306F\u3001\u8A08\u7B97\u6A5F\u79D1\u5B66\u306B\u304A\u3044\u3066\u30C7\u30FC\u30BF\u69CB\u9020\u306E\u5909\u63DB\u3092\u884C\u3046\u306B\u3042\u305F\u3063\u3066\u3001\u8FFD\u52A0\u306E\u8A18\u61B6\u9818\u57DF\u3092\u307B\u3068\u3093\u3069\u4F7F\u308F\u305A\u306B\u884C\u3046\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3092\u610F\u5473\u3059\u308B\u3002 in-place \u3068\u306F\u300C\u305D\u306E\u5834\u3067\u300D\u3068\u3044\u3063\u305F\u610F\u5473\u3067\u3042\u308A\u3001\u5165\u529B\u304C\u51FA\u529B\u3067\u4E0A\u66F8\u304D\u3055\u308C\u308B\u3053\u3068\u304C\u591A\u3044\u3053\u3068\u304B\u3089\u6765\u308B\u7528\u8A9E\u3067\u3042\u308B\u3002 in-place \u3067\u306A\u3044\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306F not-in-place \u3042\u308B\u3044\u306F out-of-place \u306A\u3069\u3068\u547C\u3070\u308C\u308B\u3053\u3068\u3082\u3042\u308B\u3002 in-place\u306E\u5B9A\u7FA9\u306B\u306F\u3084\u3084\u63FA\u308C\u304C\u3042\u308B\u3002\u6700\u3082\u72ED\u7FA9\u306B\u306F\u30DD\u30A4\u30F3\u30BF\u306A\u3069\u3082\u542B\u3081\u3066\u4E00\u5B9A\u306E\u7A7A\u9593\u3057\u304B\u4F7F\u7528\u3057\u306A\u3044\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3092\u6307\u3059\u3002\u3057\u304B\u3057\u9577\u3055n\u306E\u914D\u5217\u306E\u6DFB\u5B57\u3092\u8868\u3059\u3060\u3051\u3067\u3082 O(log n) \u306E\u7A7A\u9593\u3092\u5FC5\u8981\u3068\u3059\u308B\u305F\u3081\u3001\u3053\u306E\u610F\u5473\u3067 in-place \u3067\u3042\u308B\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306F\u3054\u304F\u9650\u3089\u308C\u3066\u3044\u308B\u3002\u591A\u304F\u306E\u5834\u5408\u3001 O(log n) \u306E\u7A7A\u9593\u3092\u4F7F\u3046\u3053\u3068\u304C\u8A31\u3055\u308C\u308B\u3002\u3088\u308A\u5E83\u304F O((log n)const.) \u7A0B\u5EA6\u307E\u3067\u8A8D\u3081\u308B\u3053\u3068\u3082\u3042\u308A\u3001\u6642\u306B\u306F o(n) \u3067\u3042\u308C\u3070\u3088\u3044\u3068\u3059\u308B\u3053\u3068\u3082\u3042\u308B\u3002"@ja . . . . "Ein Algorithmus arbeitet in-place bzw. in situ, wenn er au\u00DFer dem f\u00FCr die Speicherung der zu bearbeitenden Daten ben\u00F6tigten Speicher nur eine konstante, also von der zu bearbeitenden Datenmenge unabh\u00E4ngige Menge von Speicher ben\u00F6tigt. Der Algorithmus \u00FCberschreibt die Eingabedaten mit den Ausgabedaten. So arbeitet etwa der Bubblesort-Algorithmus in-place, w\u00E4hrend Bucketsort out-of-place arbeitet, weil die Ausgabedaten in einer zweiten Liste gespeichert werden m\u00FCssen, wodurch allerdings die urspr\u00FCnglichen Daten unber\u00FChrt bleiben. Die Platzkomplexit\u00E4t von in-place arbeitenden Algorithmen ist, in der Landau-Notation ausgedr\u00FCckt, . In puren funktionalen Programmiersprachen k\u00F6nnen Zuweisungen nicht direkt durchgef\u00FChrt werden und es ist dort daher nicht ohne weiteres m\u00F6glich, In-Place-Algorithmen zu beschreiben. Durch Optimierungen des Compilers werden jedoch in einigen funktionalen Programmiersprachen Out-of-Place-Algorithmen automatisch in \u00E4quivalente In-Place-Algorithmen \u00FCbersetzt. Beispielsweise erkennt der Glasgow Haskell Compiler, dass nach der Erzeugung einer modifizierten Kopie einer Variable das Original nicht mehr verwendet wird. In diesem Fall wird die Kopie intern als Zuweisung realisiert und somit kein zus\u00E4tzlicher Speicher verbraucht."@de . . "Ein Algorithmus arbeitet in-place bzw. in situ, wenn er au\u00DFer dem f\u00FCr die Speicherung der zu bearbeitenden Daten ben\u00F6tigten Speicher nur eine konstante, also von der zu bearbeitenden Datenmenge unabh\u00E4ngige Menge von Speicher ben\u00F6tigt. Der Algorithmus \u00FCberschreibt die Eingabedaten mit den Ausgabedaten."@de . . . . . . "219861"^^ . . . . . "In-Place-Algorithmus"@de . . . . . . . . "8596"^^ . . "Algorytm in situ (\u0142ac. in situ \u2013 w miejscu) \u2013 algorytm, kt\u00F3ry do wykonania potrzebuje sta\u0142ej ilo\u015Bci pami\u0119ci komputera, niezale\u017Cnej od rozmiaru danych wej\u015Bciowych. Wszelkie potrzebne do otrzymania wyniku obliczenia s\u0105 wykonywane w pami\u0119ci, do kt\u00F3rej zosta\u0142y za\u0142adowane dane. Algorytmy tego typu by\u0142y cenione nie tylko w czasach, kiedy komputery mia\u0142y ma\u0142o pami\u0119ci operacyjnej, lecz r\u00F3wnie\u017C obecnie, zw\u0142aszcza tam, gdzie przetwarza si\u0119 du\u017Ce ilo\u015Bci danych jak np. w obliczeniach numerycznych."@pl . . . . . . . . . . "Algoritmo in loco"@it . . . . "in-place\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3068\u306F\u3001\u8A08\u7B97\u6A5F\u79D1\u5B66\u306B\u304A\u3044\u3066\u30C7\u30FC\u30BF\u69CB\u9020\u306E\u5909\u63DB\u3092\u884C\u3046\u306B\u3042\u305F\u3063\u3066\u3001\u8FFD\u52A0\u306E\u8A18\u61B6\u9818\u57DF\u3092\u307B\u3068\u3093\u3069\u4F7F\u308F\u305A\u306B\u884C\u3046\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3092\u610F\u5473\u3059\u308B\u3002 in-place \u3068\u306F\u300C\u305D\u306E\u5834\u3067\u300D\u3068\u3044\u3063\u305F\u610F\u5473\u3067\u3042\u308A\u3001\u5165\u529B\u304C\u51FA\u529B\u3067\u4E0A\u66F8\u304D\u3055\u308C\u308B\u3053\u3068\u304C\u591A\u3044\u3053\u3068\u304B\u3089\u6765\u308B\u7528\u8A9E\u3067\u3042\u308B\u3002 in-place \u3067\u306A\u3044\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306F not-in-place \u3042\u308B\u3044\u306F out-of-place \u306A\u3069\u3068\u547C\u3070\u308C\u308B\u3053\u3068\u3082\u3042\u308B\u3002 in-place\u306E\u5B9A\u7FA9\u306B\u306F\u3084\u3084\u63FA\u308C\u304C\u3042\u308B\u3002\u6700\u3082\u72ED\u7FA9\u306B\u306F\u30DD\u30A4\u30F3\u30BF\u306A\u3069\u3082\u542B\u3081\u3066\u4E00\u5B9A\u306E\u7A7A\u9593\u3057\u304B\u4F7F\u7528\u3057\u306A\u3044\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3092\u6307\u3059\u3002\u3057\u304B\u3057\u9577\u3055n\u306E\u914D\u5217\u306E\u6DFB\u5B57\u3092\u8868\u3059\u3060\u3051\u3067\u3082 O(log n) \u306E\u7A7A\u9593\u3092\u5FC5\u8981\u3068\u3059\u308B\u305F\u3081\u3001\u3053\u306E\u610F\u5473\u3067 in-place \u3067\u3042\u308B\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306F\u3054\u304F\u9650\u3089\u308C\u3066\u3044\u308B\u3002\u591A\u304F\u306E\u5834\u5408\u3001 O(log n) \u306E\u7A7A\u9593\u3092\u4F7F\u3046\u3053\u3068\u304C\u8A31\u3055\u308C\u308B\u3002\u3088\u308A\u5E83\u304F O((log n)const.) \u7A0B\u5EA6\u307E\u3067\u8A8D\u3081\u308B\u3053\u3068\u3082\u3042\u308A\u3001\u6642\u306B\u306F o(n) \u3067\u3042\u308C\u3070\u3088\u3044\u3068\u3059\u308B\u3053\u3068\u3082\u3042\u308B\u3002 \u5165\u529B\u3092\u51FA\u529B\u3067\u4E0A\u66F8\u304D\u3057\u306A\u3044\u5834\u5408\u3001\u51FA\u529B\u3092\u8FFD\u52A0\u306E\u8A18\u61B6\u9818\u57DF\u3068\u307F\u306A\u3059\u304B\u3069\u3046\u304B\u306B\u3064\u3044\u3066\u3082\u63FA\u308C\u304C\u3042\u308B\u3002\u51FA\u529B\u5148\u304C\u901A\u5E38\u306E\u8A18\u61B6\u88C5\u7F6E\u3067\u3042\u308B\u5834\u5408\u306F\u8A18\u61B6\u9818\u57DF\u306B\u542B\u3081\u3066\u8A55\u4FA1\u3059\u308B\u304C\u3001\u66F8\u304D\u8FBC\u307F\u5C02\u7528\u30E1\u30E2\u30EA\u3084\u30B9\u30C8\u30EA\u30FC\u30E0\u306B\u51FA\u529B\u3059\u308B\u5834\u5408\u306B\u306F\u305D\u306E\u5927\u304D\u3055\u3092\u7121\u8996\u3057\u3066\u4F5C\u696D\u9818\u57DF\u3060\u3051\u3092\u8A55\u4FA1\u3059\u308B\u3053\u3068\u304C\u3042\u308B\u3002\u7279\u306B\u5BFE\u6570\u9818\u57DF\u5E30\u7740\u306E\u3088\u3046\u306A\u8A08\u7B97\u8907\u96D1\u6027\u7406\u8AD6\u306E\u554F\u984C\u3067\u306F\u51FA\u529B\u7A7A\u9593\u3092\u7121\u8996\u3059\u308B\u306E\u304C\u4E00\u822C\u7684\u3067\u3042\u308B\uFF08\u305D\u306E\u5834\u5408\u3001\u51FA\u529B\u3092\u30E9\u30A4\u30C8\u30AA\u30F3\u30EA\u30FC\u3068\u3059\u308B\u3053\u3068\u304C\u672C\u8CEA\u7684\u306B\u5FC5\u8981\u3067\u3042\u308B\uFF09\u3002"@ja . . . . . . "\u539F\u5730\u7B97\u6CD5"@zh . . . . . . . . "In-place\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0"@ja . . . "In informatica un algoritmo si dice in loco oppure in place quando \u00E8 in grado di trasformare una struttura dati utilizzando soltanto un piccolo e costante spazio di memoria extra. I dati in ingresso sono solitamente sovrascritti con il risultato prodotto durante l'esecuzione dell'algoritmo. Gli algoritmi in loco sono pi\u00F9 efficienti in termini di memoria e, spesso, anche in termini di CPU, rispetto alle controparti non in loco e tendono quindi ad essere preferiti rispetto a questi ultimi."@it . . . . "In-place algoritmus , n\u011Bkdy t\u00E9\u017E in situ nebo je algoritmus, kter\u00FD transformuje datov\u00E9 struktury za pomoc\u00ED mal\u00E9ho a p\u0159edev\u0161\u00EDm konstantn\u00EDho mno\u017Estv\u00ED pam\u011Bti. P\u0159edpokl\u00E1d\u00E1 se, \u017Ee ve\u0161ker\u00E9 zpracov\u00E1n\u00ED dat prob\u011Bhne v prostoru, kde jsou ulo\u017Eena vstupn\u00ED data. pam\u011B\u0165ov\u00E1 n\u00E1ro\u010Dnost je asymptoticky . Opak t\u011Bchto algoritm\u016F je nebo tak\u00E9 out-of-place algoritmus."@cs . "In-place algoritmus , n\u011Bkdy t\u00E9\u017E in situ nebo je algoritmus, kter\u00FD transformuje datov\u00E9 struktury za pomoc\u00ED mal\u00E9ho a p\u0159edev\u0161\u00EDm konstantn\u00EDho mno\u017Estv\u00ED pam\u011Bti. P\u0159edpokl\u00E1d\u00E1 se, \u017Ee ve\u0161ker\u00E9 zpracov\u00E1n\u00ED dat prob\u011Bhne v prostoru, kde jsou ulo\u017Eena vstupn\u00ED data. pam\u011B\u0165ov\u00E1 n\u00E1ro\u010Dnost je asymptoticky . Opak t\u011Bchto algoritm\u016F je nebo tak\u00E9 out-of-place algoritmus."@cs . . "\uC81C\uC790\uB9AC \uC54C\uACE0\uB9AC\uC998"@ko . . . . . "In computer science, an in-place algorithm is an algorithm which transforms input using no auxiliary data structure. However, a small amount of extra storage space is allowed for auxiliary variables. The input is usually overwritten by the output as the algorithm executes. An in-place algorithm updates its input sequence only through replacement or swapping of elements. An algorithm which is not in-place is sometimes called not-in-place or out-of-place. In-place can have slightly different meanings. In its strictest form, the algorithm can only have a constant amount of extra space, counting everything including function calls and pointers. However, this form is very limited as simply having an index to a length n array requires O(log n) bits. More broadly, in-place means that the algorithm does not use extra space for manipulating the input but may require a small though nonconstant extra space for its operation. Usually, this space is O(log n), though sometimes anything in O(n) is allowed. Note that space complexity also has varied choices in whether or not to count the index lengths as part of the space used. Often, the space complexity is given in terms of the number of indices or pointers needed, ignoring their length. In this article, we refer to total space complexity (DSPACE), counting pointer lengths. Therefore, the space requirements here have an extra log n factor compared to an analysis that ignores the length of indices and pointers. An algorithm may or may not count the output as part of its space usage. Since in-place algorithms usually overwrite their input with output, no additional space is needed. When writing the output to write-only memory or a stream, it may be more appropriate to only consider the working space of the algorithm. In theoretical applications such as log-space reductions, it is more typical to always ignore output space (in these cases it is more essential that the output is write-only)."@en . . "\u5728\u8BA1\u7B97\u673A\u79D1\u5B66\u4E2D\uFF0C\u4E00\u4E2A\u539F\u5730\u7B97\u6CD5\uFF08in-place algorithm\uFF0C\u4E5F\u79F0\u201C\u5C31\u5730\u7B97\u6CD5\u201D\uFF09\u662F\u57FA\u672C\u4E0A\u4E0D\u9700\u8981\u501F\u52A9\u989D\u5916\u7684\u6570\u636E\u7ED3\u6784\u5C31\u80FD\u5BF9\u8F93\u5165\u7684\u6570\u636E\u8FDB\u884C\u53D8\u6362\u7684\u7B97\u6CD5\u3002\u4E0D\u8FC7\uFF0C\u5206\u914D\u5C11\u91CF\u7A7A\u95F4\u7ED9\u90E8\u5206\u8F85\u52A9\u53D8\u91CF\u662F\u88AB\u5141\u8BB8\u7684\u3002\u7B97\u6CD5\u6267\u884C\u8FC7\u7A0B\u4E2D\uFF0C\u8F93\u5165\u7684\u6570\u636E\u5F80\u5F80\u4F1A\u88AB\u8F93\u51FA\u7ED3\u679C\u8986\u76D6\u3002\u539F\u5730\u7B97\u6CD5\u53EA\u80FD\u901A\u8FC7\u66FF\u6362\u6216\u4EA4\u6362\u5143\u7D20\u7684\u65B9\u5F0F\u6765\u4FEE\u6539\u539F\u59CB\u7684\u8F93\u5165\u3002\u4E0D\u6EE1\u8DB3\u201C\u539F\u5730\u201D\u539F\u5219\u7684\u7B97\u6CD5\u4E5F\u88AB\u79F0\u4E3A\u975E\u539F\u5730\uFF08not-in-place\uFF09\u7B97\u6CD5\u6216\u5F02\u5730\uFF08out-of-place\uFF09\u7B97\u6CD5\u3002 \u539F\u5730\u6709\u591A\u79CD\u4E0D\u540C\u7684\u542B\u4E49\u3002\u5728\u5176\u6700\u4E25\u683C\u7684\u5F62\u5F0F\u4E0B\uFF0C\u539F\u5730\u7B97\u6CD5\u53EA\u5141\u8BB8\u5360\u7528\u56FA\u5B9A\u5927\u5C0F\u7684\u989D\u5916\u7A7A\u95F4\uFF0C\u5176\u4E2D\u5305\u542B\u4E86\u51FD\u6570\u8C03\u7528\u548C\u6307\u9488\u5360\u7528\u7684\u7A7A\u95F4\u3002\u7136\u800C\uFF0C\u8FD9\u79CD\u5F62\u5F0F\u6709\u5F88\u5927\u7684\u5C40\u9650\u6027\uFF0C\u56E0\u4E3A\u4ED6\u8981\u6C42\u6307\u5411\u957F\u5EA6\u4E3A \u7684\u6570\u7EC4\u53EA\u80FD\u4F7F\u7528 \u4E2A\u6BD4\u7279\u4F4D\u3002\u800C\u66F4\u901A\u7528\u7684\u5F62\u5F0F\u8BA4\u4E3A\uFF0C\u539F\u5730\u610F\u5473\u7740\u7B97\u6CD5\u5728\u66F4\u6539\u8F93\u5165\u5185\u5BB9\u65F6\u4E0D\u9700\u8981\u989D\u5916\u7684\u7A7A\u95F4\uFF0C\u4F46\u662F\u53EF\u4EE5\u5728\u8FDB\u884C\u8FD9\u4E9B\u64CD\u4F5C\u65F6\u4F7F\u7528\u5C11\u91CF\u7684\u975E\u56FA\u5B9A\u5927\u5C0F\u7684\u7A7A\u95F4\u3002\u901A\u5E38\uFF0C\u8FD9\u90E8\u5206\u7A7A\u95F4\u590D\u6742\u5EA6\u4E3A \uFF0C\u4E0D\u8FC7\u67D0\u4E9B\u60C5\u51B5\u4E0B\u4EFB\u4F55\u6EE1\u8DB3 \u7684\u590D\u6742\u5EA6\u4E5F\u662F\u5141\u8BB8\u7684\u3002\u6CE8\u610F\u7A7A\u95F4\u590D\u6742\u5EA6\u5728\u662F\u5426\u5C06\u7D22\u5F15\u957F\u5EA6\u7EB3\u5165\u6B64\u989D\u5916\u7A7A\u95F4\u65B9\u9762\u4E5F\u662F\u6709\u591A\u79CD\u9009\u62E9\u7684\u3002\u5E38\u89C1\u7684\u8003\u91CF\u662F\u5C06\u7D22\u5F15\u7684\u6570\u91CF\u6216\u9700\u8981\u7684\u6307\u9488\u6570\u91CF\u7B97\u5230\u7A7A\u95F4\u590D\u6742\u5EA6\u5F53\u4E2D\u7684\u3002\u5728\u8FD9\u7BC7\u6587\u7AE0\u4E2D\uFF0C\u6211\u4EEC\u6240\u6307\u7684\u6574\u4F53\u7A7A\u95F4\u590D\u6742\u5EA6\uFF08\uFF09\u5C06\u6307\u9488\u957F\u5EA6\u8003\u8651\u5728\u5185\u4E86\u3002\u56E0\u6B64\uFF0C\u5206\u6790\u5BF9\u5E94\u7684\u5B58\u50A8\u7A7A\u95F4\u5360\u7528\u4F1A\u6BD4\u5FFD\u7565\u7D22\u5F15\u3001\u6307\u9488\u957F\u5EA6\u7684\u65B9\u6CD5\u591A\u4E00\u4E2A \u56E0\u5B50\u3002 \u4E00\u4E2A\u7B97\u6CD5\u65E2\u53EF\u80FD\u4F1A\uFF0C\u4E5F\u53EF\u80FD\u4E0D\u4F1A\u5C06\u8F93\u51FA\u7B97\u5165\u5176\u6574\u4F53\u7684\u7A7A\u95F4\u5360\u7528\u4E2D\u3002\u8FD9\u662F\u7531\u4E8E\u539F\u5730\u7B97\u6CD5\u901A\u5E38\u4F1A\u76F4\u63A5\u4F7F\u7528\u8F93\u51FA\u6765\u8986\u76D6\u8F93\u5165\uFF0C\u56E0\u6B64\u4E0D\u9700\u8981\u989D\u5916\u7684\u7A7A\u95F4\u3002\u5F53\u628A\u8F93\u5165\u5199\u5165\u5230\u4EC5\u5141\u8BB8\u5199\u5165\u7684\u5185\u5B58\u6216\u6D41\u5F53\u4E2D\u65F6\uFF0C\u53EA\u8003\u8651\u7B97\u6CD5\u6267\u884C\u8FC7\u7A0B\u4E2D\u7684\u7A7A\u95F4\u5F00\u9500\u53EF\u80FD\u66F4\u6070\u5F53\u4E00\u4E9B\u3002\u5728\u8BF8\u5982\u7B49\u7406\u8BBA\u5E94\u7528\u4E0A\uFF0C\u66F4\u5178\u578B\u7684\u505A\u6CD5\u5F80\u5F80\u662F\u5C06\u8F93\u51FA\u5360\u7528\u5FFD\u7565\uFF08\u5728\u8FD9\u4E9B\u60C5\u51B5\u4E0B\uFF0C\u66F4\u91CD\u8981\u7684\u662F\u8F93\u51FA\u4E3A\u4EC5\u5141\u8BB8\u5199\u5165\uFF09\u3002"@zh .