Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7767569
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 1, 20262026-06-01T15:42:37+00:00 2026-06-01T15:42:37+00:00

Hi I want to know what is the time complexity of the replaceAll function

  • 0

Hi I want to know what is the time complexity of the “replaceAll” function of the String class but I can’t find any information on it.(http://docs.oracle.com/javase/6/docs/api/java/lang/String.html)

Wouldn’t it be better for Java to include the complexities in the Javadoc? I believe it’s a very important thing for someone to know.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-01T15:42:38+00:00Added an answer on June 1, 2026 at 3:42 pm

    Most functions have fairly straight forward time complexities. AFAIK, replaceAll is O(n)

    IMHO. Nothing beats testing this yourself empirically e.g. with a profiler, because its highly likely that 99% of the methods you use have little to no impact on the performance of your application.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Long-time joelonsoftware follower, 1st-time stackoverflow poster. I want to know how safely I can
I have been asked this questions before but this time i want to know
Is there any way to know exact time complexity for .NET predefined methods. Like
I want to know if a time belongs to an schedule or another. In
I have an EnterFrame event, and I want to know the exact time between
I want to know, at run time, whether I'm running on 32 bit or
I see this from time to time and want to know what it is.
I want to write a real-time analysis tool for wireless traffic. Does anyone know
Where can I turn for information regarding computing times of mathematical functions? Has any
I know some DI frameworks support this (e.g. Ninject ), but I specifically want

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.