Skip to main content

Return to discussion

deleted 2 characters in body
Source Link
oBrstisf8o
oBrstisf8o
  • 316
  • 2
  • 14

@huseyin-tugrul-buyukisik

The inputs are prepared for the algorithms beforehand and time to compute them don't constitute to the runtime.

So no. Algorithmically-wise it wouldn't make sense either: O(n log n) vs O(n/m + log something). Although I haven't tested where's the tipping point for when sorting algorithm in c becomes slower than frequency calculation implemented in python.

@huseyin-tugrul-buyukisik

The inputs are prepared for the algorithms beforehand and time to compute them don't constitute to the runtime.

So no. Algorithmically-wise it wouldn't make sense either: O(n log n) vs O(n/m + log something). Although I haven't tested where's the tipping point for when sorting algorithm in c becomes slower than frequency calculation implemented in python.

@huseyin-tugrul-buyukisik

The inputs are prepared for the algorithms beforehand and time to compute them don't constitute to the runtime.

So no. Algorithmically-wise it wouldn't make sense either: O(n log n) vs O(m + log something). Although I haven't tested where's the tipping point for when sorting algorithm in c becomes slower than frequency calculation implemented in python.

Source Link
oBrstisf8o
oBrstisf8o
  • 316
  • 2
  • 14

@huseyin-tugrul-buyukisik

The inputs are prepared for the algorithms beforehand and time to compute them don't constitute to the runtime.

So no. Algorithmically-wise it wouldn't make sense either: O(n log n) vs O(n/m + log something). Although I haven't tested where's the tipping point for when sorting algorithm in c becomes slower than frequency calculation implemented in python.