Question

跪求cimatron it13编程基本教程

Answer 1

def MergeSort(lists):
if len(lists) <= 1:
return lists
num = int( len(lists)/2 )
left = MergeSort(lists[:num])
right = MergeSort(lists[num:])
return Merge(left, right)
def Merge(left,right):
r, l=0, 0
result=[]
while l<len(left) and r<len(right):
if left[l] < right[r]:
result.append(left[l])
l += 1
else:
result.append(right[r])
r += 1
result += right[r:]
result+= left[l:]
return result
print MergeSort([1, 2, 3, 4, 5, 6, 7, 90, 21, 23, 45])

Answer 2

164945936@qq.com谢谢

Answer 3

正在学cimatron it版本,谁能发我一套教程吗,邮箱czchendong@163.com,

Answer 4

留下邮箱发给你全套教程，Cimatron it13 it12全套造型编程视频教程+工厂图档+后处理+软件~