Inefficient algorithms can significantly slow down API responses, especially when handling large input, leading to poor performance and potential timeouts.

In this scenario, generating a large Fibonacci sequence using an inefficient algorithm results in slow response times. The impact is particularly noticeable when searching for a term within the sequence, as the delay compounds, potentially leading to timeouts and degraded user experience. Setting reasonable limits on input sizes and optimizing algorithms are essential to mitigate such performance issues.

get/performance/inefficient-algorithm

Request

  • Base URL: https://example.schemathesis.io
  • URL: https://example.schemathesis.io/performance/inefficient-algorithm
  • Auth: api_key (a scheme the document does not define)

Query parameters

ninteger required

The length of the Fibonacci sequence to be generated.

searchTerminteger required

The term to search for within the generated Fibonacci sequence.

Response

Successfully found the search term in the Fibonacci sequence.

foundAtinteger[]

The indices at which the search term was found in the Fibonacci sequence.

Changes

No recorded changes to this operation across all 1 revision of this API.