https://github.com/rideu/substep-search

Subset search algorithm that makes steps with the size of needle and tries to define whether needle is somewhere around there
https://github.com/rideu/substep-search

Last synced: over 1 year ago
JSON representation

Subset search algorithm that makes steps with the size of needle and tries to define whether needle is somewhere around there

• Host: GitHub
• URL: https://github.com/rideu/substep-search
• Owner: Rideu
• License: gpl-3.0
• Created: 2021-03-03T01:54:09.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2021-03-03T01:59:19.000Z (over 5 years ago)
• Last Synced: 2025-01-28T12:45:15.675Z (over 1 year ago)
• Language: C#
• Size: 22.5 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: license.txt

Awesome Lists containing this project

README

          
# Subset search

Subset search algorithm that skips subsets, using stepping with size of the needle. If an item presents in the needle, checks if (index of item in the stack) - (index of item in the needle) = (index of the first item of the needle), then starts straight search in the stack while all the items are in the needle. 

The larger the needle, the more efficient the algorithm.

![](gitm/demo.gif)