计数排序流程图
2018-05-10 15:34:55 0 举报
计数排序流程图
作者其他创作
大纲/内容
count - hash[index2]
hash[number] =1
YES
NO
number- a[index]
index - index2 +1
index - index +1
Statr
End
a - 一个数组; Hash - {} ;index - 0
index2 max +1
index a['length']
countIndex - 0
Hash[number == undefined]
newArr.push(index);countIndex - countIndex +1
hash[number] - hash [number] +1
print newArr
index2 - 0; max findMax(a); newArr - {}
count != undefined
countIndex count
收藏
职业：暂无
0 条评论
回复 删除
下一页
