|
I have list which is sorted using a specific string comparison function.
Now I have to re-sort this list using a different string comparison function.
This new comparsion is slightly different when comparing certain special characters, like Umlauts for...
Started by DR on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
From this ACM Paper :
Tests on randomly generated ....
It to other sort operations
As I understood your data list is allready sorted (let say by asciiInsertion sort works well on small or nearly sorted lists.
|
|
If I have a sorted list (say quicksort to sort), if I have a lot of values to add, is it better to suspend sorting, and add them to the end, then sort, or use binary chop to place the items correctly while adding them. Does it make a difference if the...
Started by Steve on
, 14 posts
by 14 people.
Answer Snippets (Read the full thread at stackoverflow):
Sorting incremental update and regular list sort are O(N log N) but you can get a better constant factor sorting....
The tree inserts are O(log(n)) for each insert, leading to overall O(n*log(n)) .
To sort a list.
|
|
Implement an algorithm to merge an arbitrary number of sorted lists into one sorted list. The aim is to create the smallest working programme, in whatever language you like.
For example:
input: ((1, 4, 7), (2, 5, 8), (3, 6, 9)) output: (1, 2, 3, 4, 5,...
Started by Alabaster Codify on
, 21 posts
by 20 people.
Answer Snippets (Read the full thread at stackoverflow):
While
Another VB.NET attempt (with an allowed sort)
Private Function Comp(ByVal l1 As List on the above figure) sort_builtin -- L = sum(lists,[]); L.sort() Deestan's solution is O(N**2) so lists the built-in sort....
|
Ask your Facebook Friends
|
Hi,
How shall sort this in ASC order?
I got List<List<UInt32>> full of records of List<UInt32> and I want those records to be sorted according to the first column in each record - the column is UInt32 number.
So:
I have List of:
new ...
Started by Skuta on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
This way it works for any IEnumerable<T>.
Nearly a duplicate of:
http://stackoverflow.com/questions/721577/how-to-sort-listliststring First() instead of accessing the 0 element in the list.
|
|
Hi,
How do I sort List<List<string>> according to number of fields?
The list got structure like
a|b|c|d|eeee|rere|ewew| ewqewq|ewew| ewew|ewewewewew|
By Sort I'd like to do it according to numbers of blockes (asc/desc)
EDIT
the <list<...
Started by Skuta on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
Var sorted to create a list that's sorted by the number of elements within a particular string in another list or....
If you don't need to sort "in place" you can use LINQ to give you a new sorted, list.
|
|
Hi, i have a generic sorted list "results" with key = some filename and value = boolean.
I would like to sort the list by the boolean entry or value column. does anyone know how i can do this?
Thanks!
Started by Grant on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Thus:
SortedList<string.
Anything else requires a re-sort.
In a sorted order at minimal cost.
|
|
I have a list of random integers. I'm wondering which algorithm is used by the list::sort() method. E.g. in the following code:
list<int> mylist; // ..insert a million values mylist.sort();
EDIT: See also this more specific question .
Started by sharkin on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
For a linked list, however, there's not really any such trade-off....
Or a linked-list version of a quick sort (contrary to popular belief, quick sort isn't necessarily unstable, the standard includes list::sort .
|
|
I know that __builtin__ sorted() function works on any iterable. But can someone explain this huge (10x) performance difference between anylist.sort() vs sorted(anylist) ? Also, please point out if I am doing anything wrong with way this is measured.
...
Started by Senthil Kumaran on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
Still, an order optimization....
So if you have a large list, part of your performance difference will be due to copying.
Well, the .sort() method of lists sorts the list in place, while sorted() creates a new list.
|
|
Private List nodes = new List();
there is a label field inside ISilverNodeModel class of type string.
suppose the nodes list is:
Malcolm, Sym, Eric, Sandrea
I want malcolm and Sandrea always on top and rest to be sorted.
I am doing this but it sorts all...
Started by Malcolm on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
You can write your own IComparer, and use that implementation in the Sort method.
|
|
I have a sorted list. When I bind it to a listbox, it does not shows the item in an ordered manner.
territoryListBox.BeginUpdate(); this.Text = ((INamedEntity)_currentList[0]).Name; territoryListBox.DataSource = _currentList; territoryListBox.DisplayMember...
Started by vIceBerg on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
IMO, sort the list first.
Items collection cannot be modified when the DataSource property is set .
|
