Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Searching Algorithms in MIPS #2

Open
Circuit-Overtime opened this issue Oct 5, 2024 · 0 comments
Open

Searching Algorithms in MIPS #2

Circuit-Overtime opened this issue Oct 5, 2024 · 0 comments
Labels
enhancement New feature or request hacktoberfest Issue Created For Hacktober Fest

Comments

@Circuit-Overtime
Copy link
Owner

Issue: Searching Algorithms Implementation

Description

I would like to add implementations of various searching algorithms in MIPS assembly language to the repository. This will provide users with a better understanding of how searching algorithms function at a low level and offer practical examples of MIPS programming.

Proposed Algorithms

Here are some searching algorithms that I propose to implement:

  1. Linear Search

    • Description: A simple searching algorithm that checks each element in the list sequentially until the desired element is found or the list is exhausted.
  2. Binary Search

    • Description: A more efficient searching algorithm that works on sorted arrays. It divides the search interval in half repeatedly, eliminating half of the remaining elements each time until the target value is found or the interval is empty.
  3. Jump Search

    • Description: A searching algorithm for sorted arrays. It works by jumping ahead by a fixed number of steps (block size) and then performing a linear search within the identified block.
  4. Interpolation Search

    • Description: An improved variant of binary search that works on uniformly distributed sorted arrays. It estimates the position of the target value based on the value of the key, rather than just halving the search space.
  5. Exponential Search

    • Description: A searching algorithm that combines binary search and the exponential search method. It works on unbounded or infinite lists, finding the range where the element is present and then performing a binary search within that range.

Implementation Details

  • Each algorithm will be implemented in a separate file named appropriately, e.g., linear_search.asm, binary_search.asm, etc.
  • Each implementation will include comments explaining the code and its logic.
  • Example inputs and expected outputs will be provided in the comments for clarity.

Additional Notes

  • Please let me know if there are any specific requirements or preferences regarding the implementation style or format.
  • I am open to suggestions for additional algorithms that could be included in this repository.

Labels

  • enhancement
  • hacktoberfest
@Circuit-Overtime Circuit-Overtime added enhancement New feature or request hacktoberfest Issue Created For Hacktober Fest labels Oct 5, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request hacktoberfest Issue Created For Hacktober Fest
Projects
None yet
Development

No branches or pull requests

1 participant