摘要:
1.冒泡排序 def bubblesort(nums): for i in range(len(nums)-1): for j in range(len(nums)-i-1):if nums[j]>nums[j+1]: nums[j],nums[j+1] =nums[j+1],nums[j] ret 阅读全文
摘要:
线性回归(正规方程求解,损失函数形式为最小二乘法) 案例: from sklearn.datasets import load_boston from sklearn.model_selection import train_test_split from sklearn.preprocessing 阅读全文