Finding a match in a tree structure is asymptotically O(log n), finding a match in a list is O(n). This router is also written in C. There is a benchmark in th

Finding a match in a tree structure is asymptotically O(log n), finding a match in a list is O(n). This router is also written in C. There is a benchmark in the README comparing R3 to the Rails router and also to a replacement Rails router that I wrote for non-performance related reasons. It should be noted that usually only a tiny proportion of the time taken to respond to a request is spent in route recognition. YMMV.