[feature] added linear search algorithm code which has O(n) complexity#39
[feature] added linear search algorithm code which has O(n) complexity#39pushpitkamboj wants to merge 3 commits intomasterfrom
Conversation
Features
~~~~~~~~
- Added a linear search algorithm implementation with O(n) complexity.
`#39 <https://github.com/openwisp/bot-testing-ground/pull/39>`_ |
Features
~~~~~~~~
- Added a linear search algorithm implementation with O(n) complexity.
`#39 <https://github.com/openwisp/bot-testing-ground/pull/39>`_ |
…ch_algo # Please enter a commit message to explain why this merge is necessary, # especially if it merges an updated upstream into a topic branch. # # Lines starting with '#' will be ignored, and an empty message aborts # the commit.
re trigger CI with complex commit changes
Features
~~~~~~~~
- Added a linear search algorithm with O(n) complexity.
- Introduced a simple dungeon adventure game with player, room, and combat mechanics.
`#39 <https://github.com/openwisp/bot-testing-ground/pull/39>`_ |
This is not on track @pushpitkamboj. Maybe I did not explain myself properly in openwisp/openwisp-utils#523, but the heading is unnecesary. The output we need from this bot is just something like the following: This would then be processed by our releaser tool and added to the changelog and from there it will end up in our release notes. With Sometimes PRs can take a number of iterations and by the time we are done, the original description of the PR is not enough to summarize all the changes, the goal of this bot is to create the summary for us automatically, saving our time. Is it clear now? |
created a linear search algo code with O(n) complexity. Fixes issue #38