User Sam Westrick

7 votes

Accepted

Find the shortest path that goes through an even number of red edges

answered May 20, 2020 at 21:48

3 votes

Accepted

Plain-language example of how a functional style makes parallel programming easier

functional-programming parallel-computing imperative-programming

answered Mar 27, 2021 at 19:32

3 votes

Accepted

Insert a node in a binary search tree

algorithms binary-trees

answered May 8, 2020 at 15:58

2 votes

Formal definition of the Dynamic Array - what is the Dynamic Array

data-structures arrays abstract-data-types

answered May 10, 2020 at 22:05

2 votes

MST with degree constraints on some node

minimum-spanning-tree

answered May 12, 2020 at 20:56

2 votes

Accepted

The longest path in a tree

graphs trees

answered May 3, 2017 at 1:30

2 votes

What do we benefit from using ternary search trees rather than binary search trees?

data-structures binary-trees search-trees

answered Dec 10, 2017 at 5:04

2 votes

Accepted

rebalance red-black tree with many violations

binary-trees balanced-search-trees

answered Dec 16, 2017 at 21:16

2 votes

What would be the big O notation for a function that attempts to find pairs of users that participate in different discussions?

algorithms big-o-notation

answered Jun 15, 2021 at 18:11

1 vote

Accepted

GroupBy key a sequence of ordered key values

algorithms parallel-computing haskell

answered Jul 14, 2021 at 23:17

1 vote

Parallized algorithm for getting the frequencies of numbers in an array

parallel-computing

answered Apr 1, 2021 at 0:18

1 vote

how does the parallel radix sort work?

algorithms sorting parallel-computing radix-sort

answered Jan 22, 2018 at 5:22

1 vote

Accepted

Calculate Shortest Path (Shortest Time) Through a Store in a Graph

algorithms graphs shortest-path

answered Nov 8, 2018 at 14:01

1 vote

Do dynamic/static languages associate types or classes to values or variables?

programming-languages type-theory type-checking

answered May 5, 2020 at 14:07

1 vote

Accepted

Forming red-black tree from binary tree conserving in-order traversal

algorithms data-structures binary-trees search-trees balanced-search-trees

answered May 20, 2017 at 18:57

1 vote

Accepted

Rotations in a treap

trees heaps binary-search-trees

answered May 23, 2017 at 12:51

Stack Exchange Network

current community

your communities

more stack exchange communities

16 Answers

Find the shortest path that goes through an even number of red edges

Plain-language example of how a functional style makes parallel programming easier

Insert a node in a binary search tree

Formal definition of the Dynamic Array - what is the Dynamic Array

MST with degree constraints on some node

The longest path in a tree

What do we benefit from using ternary search trees rather than binary search trees?

rebalance red-black tree with many violations

What would be the big O notation for a function that attempts to find pairs of users that participate in different discussions?

GroupBy key a sequence of ordered key values

Parallized algorithm for getting the frequencies of numbers in an array

how does the parallel radix sort work?

Calculate Shortest Path (Shortest Time) Through a Store in a Graph

Do dynamic/static languages associate types or classes to values or variables?

Forming red-black tree from binary tree conserving in-order traversal

Rotations in a treap