User Robert S. Barnes - Computer Science Stack Exchange

Robert S. Barnes

Member for 11 years, 2 months
Last seen more than 5 years ago

lxr.linux.no
Jerusalem, Israel

17 Questions

Score Activity Newest Views

110 votes

2 answers

80k views

Quicksort Partitioning: Hoare vs. Lomuto

asked Apr 21, 2013 at 8:02

38 votes

4 answers

6k views

How to measure "sortedness"

asked May 6, 2013 at 17:38

23 votes

3 answers

12k views

Practical Applications of Radix Sort

asked May 23, 2013 at 7:29

21 votes

2 answers

12k views

Sort array of 5 integers with a max of 7 compares

asked Apr 1, 2013 at 18:18

11 votes

6 answers

12k views

What is an Efficient Algorithm?

asked Mar 12, 2013 at 10:11

9 votes

1 answer

383 views

What Measure of Disorder to use when Analysing Quicksort

asked May 7, 2013 at 6:08

7 votes

2 answers

462 views

Are functions in O(n) that are nor in o(n) all in Θ(n)?

asked Mar 7, 2013 at 7:47

6 votes

2 answers

492 views

Landau Notation, Definitions: Limits vs. Corman's

asked Mar 15, 2013 at 7:19

6 votes

2 answers

194 views

Binary Search Tree: Replace $k$ min elements with their average

asked Jun 30, 2013 at 9:09

4 votes

1 answer

3k views

Counting Inversions Using Merge Sort

asked Feb 17, 2013 at 10:23

4 votes

2 answers

3k views

Asymptotic Properties of Functions in Complexity Analysis

asked Mar 20, 2013 at 20:07

4 votes

2 answers

849 views

From Whence the Randomization in Randomized Quicksort

asked Apr 18, 2013 at 18:04

3 votes

2 answers

3k views

Methods for Finding Asymptotic Lower Bounds

asked Mar 13, 2013 at 18:57

2 votes

2 answers

651 views

Common Algorithms without Asymptotically Tight Bounds

asked Mar 7, 2013 at 8:39

2 votes

1 answer

2k views

Cost at Each Level of a Recursion Tree

asked Apr 29, 2013 at 9:50

1 vote

1 answer

205 views

Deciding between two algorithms with similar runtime in two parameters

asked Jul 7, 2013 at 13:25

1 vote

3 answers

315 views

Loop Invariants as Tautologies

asked Mar 12, 2013 at 7:57