learn js Promise

pool.js

pool = []
pool.push([1,1])

plus = async (a,b)=>await a+ await b
time = async (a)=>2* await a

main = async() =>{
    for(var i=1;i<=10;i++){
        pool.push([
            plus(pool[i-1][0], pool[i-1][1]),
            time(pool[i-1][1])
        ])
    }
    return await pool[10][1]
}

main().then((n)=>console.log(n))

pool.py

async def plus(a,b):
     return await a + await b

async def time(a):
    return 2* await a

async def one():
    return 1

pool = [[one(),one()]]

async def main():
    for i in range(1,11):
        pool.append([
            plus(pool[i-1][0],pool[i-1][1]),
            time(pool[i-1][1])
        ])
    print(await pool[10][1])
    return 0

import asyncio
loop = asyncio.get_event_loop()
loop.run_until_complete(main())

qsort.js

plus = async (l,m,i)=>{
  while(l[i]<m)i++;
  return i;
}

minus = async (l,m,j)=>{
  while(l[j]>m)j--;
  return j;
}

var _qsort = async (l,a,b) =>{
  if(a>=b)return Promise.resolve([])
  var m = l[parseInt((a+b)/2)];
  var i=a, j=b;
  while(i<=j){
    [i,j] = await Promise.all([plus(l,m,i), minus(l,m,j)])
    if(i<=j){
        [l[i],l[j]]=[l[j],l[i]];
        i++;
        j--;
    }
  }
  left = _qsort(l,a,j)
  right = _qsort(l,i,b)
  return await Promise.all([left, right])
}

var qsort = (l) => {
  _qsort(l,0,l.length-1).then(()=>
    console.log(l)
  )
}
l = [56,8934,324,57,32,243,57,7,43,324,25,35,78,743,32,423,54456756]
qsort(l)