String-searching algorithm: Revision history


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 ( | ) (20 | 50 | 100 | 250 | 500)

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

17 May 2021

18 April 2021

13 February 2021

17 January 2021

7 January 2021

5 January 2021

25 December 2020

24 October 2020

11 October 2020

23 September 2020

13 September 2020

12 September 2020

11 September 2020

9 September 2020

16 May 2020

13 May 2020

23 February 2020

15 January 2020

6 January 2020

4 December 2019

29 November 2019

23 November 2019

22 November 2019

9 September 2019

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