SystemSh0cker/monaco-editor
1
0
Fork 0
mirror of https://github.com/microsoft/monaco-editor.git synced 2025-12-22 18:32:56 +01:00
Code Issues Projects Releases Packages Activity

deploy: e531b5c337

Browse source
This commit is contained in:
azure-pipelines[bot] 2023-03-28 07:39:06 +00:00
parent 67e01c76b4
commit 02bed41d9a
554 changed files with 652 additions and 377 deletions
Download patch file Download diff file Expand all files Collapse all files

2
8189.js Normal file
View file

@ -0,0 +1,2 @@
"use strict";(self.webpackChunkmy_application=self.webpackChunkmy_application||[]).push([[8189],{8189:(n,i,e)=>{e.r(i),e.d(i,{default:()=>r});const r='package examples\n\n/** Quick sort, imperative style */\nobject sort {\n\n /** Nested methods can use and even update everything\n * visible in their scope (including local variables or\n * arguments of enclosing methods).\n */\n def sort(a: Array[Int]) {\n\n def swap(i: Int, j: Int) {\n val t = a(i); a(i) = a(j); a(j) = t\n }\n\n def sort1(l: Int, r: Int) {\n val pivot = a((l + r) / 2)\n var i = l\n var j = r\n while (i <= j) {\n while (a(i) < pivot) i += 1\n while (a(j) > pivot) j -= 1\n if (i <= j) {\n swap(i, j)\n i += 1\n j -= 1\n }\n }\n if (l < j) sort1(l, j)\n if (j < r) sort1(i, r)\n }\n\n if (a.length > 0)\n sort1(0, a.length - 1)\n }\n\n def println(ar: Array[Int]) {\n def print1 = {\n def iter(i: Int): String =\n ar(i) + (if (i < ar.length-1) "," + iter(i+1) else "")\n if (ar.length == 0) "" else iter(0)\n }\n Console.println("[" + print1 + "]")\n }\n\n def main(args: Array[String]) {\n val ar = Array(6, 2, 8, 5, 1)\n println(ar)\n sort(ar)\n println(ar)\n }\n\n}\n'}}]);
//# sourceMappingURL=8189.js.map