Skip to main content
MathOverflow
Userbejian29's user avatar
Userbejian29's user avatar
Userbejian29's user avatar
Userbejian29
  • Member for 9 years, 1 month
  • Last seen more than 2 years ago
Profile Activity

13 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Supporter
revised
Coloring graph with maximum vertex degree $< k$ so every vertex is a starting point for a path containing each color
deleted 32 characters in body; edited title
revised
Coloring graph with maximum vertex degree $< k$ so every vertex is a starting point for a path containing each color
added 181 characters in body
revised
Coloring graph with maximum vertex degree $< k$ so every vertex is a starting point for a path containing each color
edited tags; edited title
asked
Coloring graph with maximum vertex degree $< k$ so every vertex is a starting point for a path containing each color
comment
What is the fastest way to sort numbers lexicographically?
It is not from a programming competition. I am solving problems from SPOJ, UVA, CodeForces etc. and recently I've been doing task that required fast algorithm for comparing sequences lexicographically. Solution with quicksort was fast enough, because data wasn't big, but I wondered if there exist algorithm that could do it faster.
awarded
 Editor
awarded
 Scholar
accepted
What is the fastest way to sort numbers lexicographically?
awarded
 Student
comment
What is the fastest way to sort numbers lexicographically?
It is the length of the longest sequence. In example above K = 3, because length of the longest sequence is 3.
asked
What is the fastest way to sort numbers lexicographically?
awarded
 Informed