This repository contains several sorting algorithms and their optimised algorithms.
Design of OpenMP-based Parallel Dynamic PageRank algorithm for measuring importance.
Python script-supervisor iteratively executes script-agent and modifies it via LLM that is instructed with description of supervisor functioning and final goal, then at each iteration gets retval, stdout, stderr of current agent, and is asked to reply with next agent verbatim. Optional jailbreak attempt. TUI. Unsafe.
Design of OpenMP-based statically scheduled Barrier-free Dynamic PageRank algorithm for link analysis.
A Swift Playground with examples for several common methods of traversing binary trees.
Guide for creating prompts for large language models.
Angular pwa example
Find value that occurs in odd number of elements.
Design of OpenMP-based Lock-free Dynamic PageRank algorithm for link analysis.
Computer programs to solve complex numerical problems
Comparing static vs dynamic approaches of the Louvain algorithm for community detection.
This repository contains two implementations (iterative and recursive) of Floyd's algorithm for finding the shortest paths between all pairs of nodes in a weighted graph. Also included is a performance test to benchmark and directly compare the two versions' performance.
Add a description, image, and links to the iterative topic page so that developers can more easily learn about it.
To associate your repository with the iterative topic, visit your repo's landing page and select "manage topics."