Skip to content

Implement Google Search engine simulator using Binary Search Tree, Bucket Sort and QuickSort

Notifications You must be signed in to change notification settings

trinwin/GoogleSearchSimulator-v2

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

GoogleSearchSimulator v2

Google's search engine is a powerful tool and I want to create a simulator Google Search Engine Results Page (SERP).

Update from v1:

  1. For each search keyword/term, display only the top 10 priority search result items/links based on the PageRank using Quicksort algorithm instead of using Heapsort.

  2. Based on scores of 30 URLs, use Binary Search Tree to manipulate the data.

  3. To speed up the search result, Google search engine dynamically collects a list of top N popular keywords. Use Bucket Sort to implement that idea of sorting company’s names of URLs in alphabetical order.

What I Learned

  • Implemented Binary Search Tree
  • Implemented Quick sort
  • Implemented Bucker sort

Plan for GoogleSearchSimulator v3

  • Improve the performance of the application using Red-Black Tree
  • Add new features to the app (search, delete, insert)

About

Implement Google Search engine simulator using Binary Search Tree, Bucket Sort and QuickSort

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages