Merge branch 'master' of https://github.com/ligecarryme/algorithm-pattern-JavaScript

Author: xingdali

入门（Java）/经典算法TS实现.md

@@ -13,20 +13,55 @@
 
 #### 选择排序
 
-```java
-
+```tsx
+const selectSort =function (nums:number[]){
+const len =nums.length
+for (let i =0; i<len; i++){
+let min =i
+for (let j =i+1; j<len; j++){
+if (nums[j] <nums[min]){
+min=j
+ }
+ }
+ ;[nums[i], nums[min]] = [nums[min], nums[i]]
+ }
+returnnums
+}
 ```
 
 #### 冒泡排序
 
-```java
-
+```tsx
+const bubbleSort =function (arrs:number[]){
+const len =arrs.length
+let isSortFlag =false// 如果排好序只需遍历一遍
+for (let i =len-1; i>0&&!isSortFlag; i--){
+isSortFlag=true
+for (let j =0; j<i; j++){
+if (arrs[j] >arrs[j+1]){
+isSortFlag=false
+ ;[arrs[j], arrs[j+1]] = [arrs[j+1], arrs[j]]
+ }
+ }
+ }
+returnarrs
+}
 ```
 
 #### 插入排序
 
-```java
-
+```tsx
+const insertSort =function (nums:number[]){
+const len =nums.length
+for (let i =1; i<len; i++){
+for (let j =i; j>0; j--){
+if (nums[j] <nums[j-1]){
+ ;[nums[j], nums[j-1]] = [nums[j-1], nums[j]]
+ }
+ }
+ }
+returnnums
+}
 ```
 
 #### 希尔排序

论文/论文FaaSNet-ali.md

@@ -16,7 +16,7 @@ FaaS平台最具吸引力的是资源弹性，允许用户程序在几秒内按
 
 2.1 工作流
 
-![](/Users/didi/Desktop/leetcode/论文/image/workflows.png)
+![](./image/workflows.png)
 
 2.2 工作负载分析