Recursion, graph loops

Open dumblob opened this issue 3 years ago • 2 comments

I wonder how to do (indirect) recursion in Zed. In other words how to construct arbitrary loops in the graph? How would I implement e.g. quick sort purely in the Zed language (without the use of existing libs)?

Lateral queries & scopes seem somewhat in those waters but do not seem to cut it.

May 04 '22 08:05 dumblob

Thanks, @dumblob. This isn't currently part of the model. Did you have a use case in mind?

May 11 '22 00:05 mccanne

I was expecting implementing "recursive algos" is possible. E.g. quick sort. Any ideas how to approach it?

May 11 '22 07:05 dumblob