C# sort List's

Question

Hello everyone This is my problem and i don't know how to solved. I create 8 list List vreme = new List (); List latituda = new List (); List longituda = new List (); List gpsKvalitet = new List (); List brojSatelita = new List (); List hdop = new List (); List visina = new List (); List vremeDT = new List (); Than i use vreme.Sort(); and sorting first list . but now i want s ort other by first list i mean if vreme[7] after sorting take place vreme[1] i want the element in other list latituda[7] longituda[7] gpsKvalitet[7] brojSatelita[7] hdop[7] visina[7] vremeDT[7] take new place latituda[1] longituda[1] gpsKvalitet[1] brojSatelita[1] hdop[1] visina[1] vremeDT[1] after finish sorting.

Vulpes · Answer

Although the Array.Sort(TKey TValue) method is a reasonable approach where you only have two associated lists to sort it's both unwieldy and inefficient where you have eight. However the following variation of it is not too bad and you could use it where the lists are large as it would then use the quicksort algorithm rather than an insertion sort: string[] vremeArray = vreme.ToArray(); int[] newOrder = new int[vreme.Count]; for(int i = 0; i Array.Sort(vremeArray newOrder); //newOrder now contains revised order of elements vreme = new List (vremeArray); int count = newOrder.Length; for (int i = 0; i { latituda.Add(latituda[newOrder[i]]); longituda.Add(longituda[newOrder[i]]); gpsKvalitet.Add(gpsKvalitet[newOrder[i]]); brojSatelita.Add(brojSatelita[newOrder[i]]); hdop.Add(hdop[newOrder[i]]); visina.Add(visina[newOrder[i]]); vremeDT.Add(vremeDT[newOrder[i]]); } latituda.RemoveRange(0 count); longituda.RemoveRange(0 count); gpsKvalitet.RemoveRange(0 count); brojSatelita.RemoveRange(0 count); hdop.RemoveRange(0 count); visina.RemoveRange(0 count); vremeDT.RemoveRange(0 count);

sasa lazic · Answer

Thanks

sasa lazic · Answer

Thanks a lot its work I find solution on google //List vreme = new List (); //List latituda = new List (); //string[] vremeNoSort = vrNoSort.ToArray();//po ovome sortiram ostale lise //double[] latitudaSort = latitudaNoSort.ToArray();//prva ostala lista //double[] longitudaSort = longitudaNoSort.ToArray(); //int[] gpsKvalitetSort = gpsKvalitetNoSort.ToArray(); //int[] brojSatelitaSort = brojSatelitaNoSort.ToArray(); //double[] hdopSort = hdopNoSort.ToArray(); //double[] visinaSort = visinaNoSort.ToArray(); //Array.Sort(vremeNoSort latitudaSort); //Array.Sort(vremeNoSort longitudaSort); //Array.Sort(vremeNoSort gpsKvalitetSort); //Array.Sort(vremeNoSort brojSatelitaSort); //Array.Sort(vremeNoSort hdopSort); //Array.Sort(vremeNoSort visinaSort); //vreme = new List (vremeNoSort); //latituda = new List (latitudaSort); //longituda = new List (longitudaSort); //gpsKvalitet = new List (gpsKvalitetSort); //brojSatelita = new List (brojSatelitaSort); //hdop = new List (hdopSort); //visina = new List (visinaSort); But this not work correct. Might give you an idea for future. thanks again

Vulpes · Answer

I think your best option would be to sort all 8 lists together manually so they can maintain their association with the first list after sorting. If the lists are not very large this insertion sort should be reasonably efficient: for (int i = 1; i { string value1 = vreme[i]; double value2 = latituda[i]; double value3 = longituda[i]; int value4 = gpsKvalitet[i]; int value5 = brojSatelita[i]; double value6 = hdop[i]; double value7 = visina[i]; string value8 = vremeDT[i]; int j = i - 1; while ((j >= 0) && (vreme[j].CompareTo(value1) > 0)) { vreme[j + 1] = vreme[j]; latituda[j + 1] = latituda[j]; longituda[j + 1] = longituda[j]; gpsKvalitet[j + 1] = gpsKvalitet[j]; brojSatelita[j + 1] = brojSatelita[j]; hdop[j + 1] = hdop[j]; visina[j + 1] = visina[j]; vremeDT[j + 1] = vremeDT[j]; j--; } vreme[j + 1] = value1; latituda[j + 1] = value2 ; longituda[j + 1] = value3; gpsKvalitet[j + 1] = value4 ; brojSatelita[j + 1] = value5; hdop[j + 1] = value6 ; visina[j + 1] = value7; vremeDT[j + 1] = value8; }