Misplaced Pages

String-searching algorithm: Revision history

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
View logs for this page (view filter log)
Filter revisionsshowhide
External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

20 December 2024

25 November 2024

20 September 2024

7 April 2024

27 January 2024

24 January 2024

29 December 2023

27 December 2023

25 October 2023

7 October 2023

6 October 2023

24 September 2023

25 July 2023

  • curprev 19:4319:43, 25 July 2023 Citation bot talk contribs 18,577 bytes +5 Alter: title, template type. Add: chapter-url, chapter. Removed or converted URL. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Misplaced Pages:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 1952/2384 undo

8 April 2023

16 March 2023

3 February 2023

19 January 2023

22 December 2022

16 November 2022

22 October 2022

  • curprev 22:2922:29, 22 October 2022 37.19.108.190 talk 18,590 bytes +32 BNDM algorithm's matching complexity is not O(n), it's the same as for the Boyer-Moore - Omega(n/m) at best, O(n*m) at worst. https://users.dcc.uchile.cl/~gnavarro/ps/cpm98.pdf undo

13 October 2022

10 May 2022

22 March 2022

19 March 2022

3 February 2022

2 January 2022

10 November 2021

4 October 2021

  • curprev 01:2701:27, 4 October 2021 Aamini11 talk contribs 15,937 bytes +6 Undid revision 1048056351 by Aamini11 (talk) undo Tag: Undo
  • curprev 00:5900:59, 4 October 2021 Aamini11 talk contribs 15,931 bytes −6 Θ((n-m)m) = Θ(mn). Having it listed is Θ(mn) would be bettter since it's a more simplified version of the previous expression. It's also more consistent since other time complexities in the table are listed as O(mn) instead of O(m*(m-n)), even though they technically could be. The full wiki article for the Rabin–Karp algorithm also states "its worst-case time complexity is the product of the two lengths" undo Tag: Reverted

25 August 2021

22 August 2021

7 August 2021

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)