# Prolog's performance on "Billion Nested Loop Iteration"

**URL:** <https://swi-prolog.discourse.group/t/prologs-performance-on-billion-nested-loop-iteration/9473>\
**Category:** General\
**Created:** [January 12, 2026, 3:23am UTC](https://swi-prolog.discourse.group/t/prologs-performance-on-billion-nested-loop-iteration/9473 "2026-01-12T03:23:10Z")\
**Posts on this page:** 1\
**Showing post:** 13

<div class="post-metadata">

**Author:** ![peter.ludemann](https://yyz2.discourse-cdn.com/free1/user_avatar/swi-prolog.discourse.group/peter.ludemann/32/48_2.png) [@peter.ludemann](https://swi-prolog.discourse.group/u/peter.ludemann)\
**Post date:** [January 12, 2026, 9:10pm UTC](https://swi-prolog.discourse.group/t/prologs-performance-on-billion-nested-loop-iteration/9473/13 "2026-01-12T21:10:41Z")

</div>

> [@jan](#):
>
> Few algorithms based arrays and notably updating arrays can be represented comfortably and efficient in Prolog.

Richard O’Keefe implemented FFTs in Prolog: [Learning to implement data structures & algorithms in Prolog - #4 by peter.ludemann](https://swi-prolog.discourse.group/t/learning-to-implement-data-structures-algorithms-in-prolog/5327/4)

---

_[View the full topic](https://swi-prolog.discourse.group/t/prologs-performance-on-billion-nested-loop-iteration/9473)._