> Now I use algorithm like this (maybe not optimal); > > Dim ii As Integer > Dim jj As Integer > Dim bRemove As Boolean > > While ii < iMyArray.Count > > jj = 0 > bRemove = False > While jj < iMyArray.Count > If ii <> jj And iMyArray[ii] = iMyArray[jj] Then > iMyArray.Remove(ii) > bRemove = True > Else > Inc jj > Endif > Wend > > If bRemove = False Then > Inc ii > Endif > Wend > > > Good point Benôit. Array is populated from file, but maybe I should use > .Find() before .Add(). > > > Jussi >
You should use a collection to detect duplicates, otherwise your algorithm is O(n^2) Regards, -- Benoît ------------------------------------------------------------------------------ Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day trial. Simplify your report design, integration and deployment - and focus on what you do best, core application coding. Discover what's new with Crystal Reports now. http://p.sf.net/sfu/bobj-july _______________________________________________ Gambas-user mailing list Gambas-user@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/gambas-user
