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 8344227
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 9, 20262026-06-09T06:17:54+00:00 2026-06-09T06:17:54+00:00

I have two big text Files each having more than 10 Million lines. How

  • 0

I have two big text Files each having more than 10 Million lines. How can i compare the files and get different lines in the files using C++.

I have tried loading one file into memory and sorted the memory and used the binary tree logic to compare the files. It compared and gave me the result in 20 Sec. But it’s consuming more memory. (The text file is around 500 MB).

I want to compare two files without consuming more memory, a Good Performance and to have minimal effects on Hard Disk.

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

    you can use a two pass method.

    first pass, you read files but only store hash value and line start pos of lines, then u can compare files based on hash value, you only read the lines again for complete compare in the second pass when two lines have same hash value. this will save memory consumption and cpu time, with a bit penalty to read some lines twice.

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

Sidebar

Related Questions

I have two lines of text which have long space (more like 14-15 spaces)
I have two QT apps. One app can be considered to hold a big
I have a big unix text file and I want to get the line
I have two hashes, one big and one small. All of the smaller hash's
I have a big problem. I have a activity where I have two imageViews.
I have SQL Server 2008 Ent and OLTP database with two big tables. How
I think I have a big problem. I have a two projects solution. First
Have two folders with approx. 150 java property files. In a shell script, how
I have two files client.php and server.php. The client file send a HTTP request
I am creating a site with lots of big scrollable text-boxes in it. Each

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.