Monday, October 27, 2014

Assignment 1

Assignment 1 is ready ... checkout the "Assignments" tab.

Start early and do not hesitate to ask if you face any problems.

Enjoy!

 Update: It seems that the E-Learning website at PSUT is down. I have added an alternative link just in case you are facing problems in downloading this assignment

Posted by at

4 comments:

  1. UnknownNovember 8, 2014 at 2:29 AM

    hello Dr ...
    i know am late... but i need your help..
    how can we modify the insertion sort algorithm such that it uses binary search instead of linear search....when the binary search must be used on already sorted arrays ??

    ReplyDelete
    Replies
    1. Ibrahim AlbluwiNovember 8, 2014 at 3:43 AM

      Insertion sort works by dividing the array into sorted and unsorted parts. At each iteration one element from the unsorted part is inserted into the sorted part. Binary search can be used to find the position at which the element should be inserted into the sorted part.

      Delete
    2. UnknownNovember 8, 2014 at 5:29 AM

      i didn't get what you said...but thanks so much :D another question
      how are we suppose to submit the 5 tables ??

      Delete
    3. Ibrahim AlbluwiNovember 8, 2014 at 10:20 AM

      Review how insertion sort works. You will find that in each step there is always part of the array that is sorted.

      For submitting the assignment, zip all of your work and upload it here:
      http://psut.jo/elearning/mod/assignment/view.php?id=12282

      Delete

Subscribe to: Post Comments (Atom)