for 100 substitutions, considering the number of permutations, I think that's quite reasonable! the others not so good, but again, remember it's not a linear search, adding 1 substitution increases search time on a log scale.
How can I make a faster search algorithm
How can I make a faster search algorithm
|
|
Possibly Related Threads… | |||||
Thread | Author | Replies | Views | Last Post | |
Basic binary search algorithm - using a while loop | Drone4four | 1 | 432 |
Jan-22-2024, 06:34 PM Last Post: deanhystad |
|
Writing a Linear Search algorithm - malformed string representation | Drone4four | 10 | 1,077 |
Jan-10-2024, 08:39 AM Last Post: gulshan212 |
|
go over and search in numpy array faster | caro | 7 | 1,874 |
Jun-20-2022, 04:54 PM Last Post: deanhystad |
|
Trying to search and make new column from the keyword. | dgarg | 1 | 1,509 |
Dec-20-2021, 08:41 PM Last Post: deanhystad |
|
Search faster? | Pedroski55 | 1 | 1,976 |
Dec-06-2020, 10:03 PM Last Post: Larz60+ |
|
how to make iterative search more efficient | renergy | 2 | 2,293 |
Jan-03-2020, 03:43 PM Last Post: stullis |
|
To make an algorithm work faster | pianistseb | 3 | 2,847 |
Apr-01-2019, 08:42 AM Last Post: Gribouillis |
|
How can I make this function faster? | Brennan | 10 | 6,300 |
Jun-29-2018, 08:33 PM Last Post: ichabod801 |
|
How do I make this code run faster? | DontHurtMe | 0 | 2,453 |
Nov-04-2017, 12:12 PM Last Post: DontHurtMe |
Users browsing this thread: 1 Guest(s)