/// <summary>
        /// 协同排序
        /// </summary>
        /// <param name="sod"></param>
        /// <param name="dis"></param>
        /// <returns></returns>
        private List<int> oids(List<int> sod, List<double> dis)
        {

            for (int tmpi = 0; tmpi < dis.Count; tmpi++)
            {
                //找到最小的id
                int lid = tmpi;
                for (int tmpj = tmpi + 1; tmpj < dis.Count; tmpj++)
                {
                    if (dis[lid] > dis[tmpj])
                    {
                        lid = tmpj;
                    }
                }
                //互换最小的与当前
                double ti = dis[lid];
                int tname = sod[lid];
                dis[lid] = dis[tmpi];
                dis[tmpi] = ti;
                sod[lid] = sod[tmpi];
                sod[tmpi] = tname;
            }

            return sod;
        }

 

相关文章:

  • 2021-10-16
  • 2022-12-23
  • 2022-12-23
  • 2021-09-13
  • 2022-12-23
  • 2021-06-24
  • 2022-12-23
  • 2022-12-23
猜你喜欢
  • 2021-04-03
  • 2022-12-23
  • 2022-12-23
  • 2021-11-23
  • 2021-07-02
  • 2022-12-23
相关资源
相似解决方案