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

  • Home
  • SEARCH
  • 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 9124893
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 17, 20262026-06-17T06:40:20+00:00 2026-06-17T06:40:20+00:00

I have a question about rehashing. As far as i know, when the load

  • 0

I have a question about rehashing. As far as i know, when the load factor (number of elements in the table / size of table) reaches 0.5, we use rehashing and by rehashing, we expect to decrease collisions. I am pretty sure that rehashing can be used while doing quadratic probing, and my question is, should can rehashing be used with linear probing, or separate chaining? Is there any logic of using rehash while doing separate chaining, or linear probing?

Thanks

  • 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-17T06:40:21+00:00Added an answer on June 17, 2026 at 6:40 am

    Generally we do re-hashing when hashtable is filles beyond certain number-Load Factor, as you have explained. While doing re-hash, we increase the size of hashtable and do the re-hashing. Rehashin is not about using alternative hashing strategy its about rehashing into new sized hashtale(with old/new strategy)

    It’s up to you which collision handling strategy to use. Generally people go for closed hashing.We can use separate chaining also but it is used for only for unknown and known sizes but open addressing is used for known sizes .So if the size is known mostly we prefer open addressing to avoid data wastage.

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

Sidebar

Related Questions

I have a question about rehashing. Let us say, we have a hash table
i have question about how to count matched elements in ArrayList in java.. Ex:
I have question about database optimizing, indexing. I have table that called projects and
I have a question about use of the goto statement in C++. I understand
I have question about python and sqlite3. I want to drop a table from
I have question about the d3 javascript libarary. I want to use the azimuthal
I have question about pattern Table data Gateway... I´m creating small project, only for
i have question about why should we use return in get,if dont use what
I have question about parsing in Html helper : I have sth like: @foreach
I have question about clean thory in Python. When: @decorator_func def func(bla, alba): pass

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.