-
Notifications
You must be signed in to change notification settings - Fork 325
Issues: fnplus/interview-techdev-guide
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Author
Label
Projects
Milestones
Assignee
Sort
Issues list
A forensic lab wants to know whether a deceased person’s DNA matches a set of known relatives. It is known that the closest relatives will have most of the DNA matching, and as the relationship becomes farther, the matching genes will be lesser. For this, the DNA pattern of the deceased is given and the DNA pattern of 10 likely relatives are given. Write a program to identify the family of the deceased.
#632
opened Oct 26, 2019 by
shrikantpadhy18
Write the code for bubble sort, insertion sort, quicksort(with random pivot), mergesort and heapsort for sorting N numbers. Vary the value of N from 500, 1000, 5000, 10000, 50000, 100000, 500000, 1000000, 5000000; and for each value perform 10 observations of execution time for the search operation. Plot the result in a graph.
#631
opened Oct 26, 2019 by
shrikantpadhy18
Previous Next
ProTip!
no:milestone will show everything without a milestone.