[Savannah-register-public] [task #5728] Submission of Sort Analyser

[Parthasarathy]

URL:
  <http://savannah.nongnu.org/task/?func=detailitem&item_id=5728>

                 Summary: Submission of Sort Analyser
                 Project: Savannah Administration
            Submitted by: sara_savannah
            Submitted on: Monday 07/17/2006 at 15:25
         Should Start On: Monday 07/17/2006 at 00:00
   Should be Finished on: Thursday 07/27/2006 at 00:00
                Category: Project Approval
                Priority: 5 - Normal
                  Status: None
                 Privacy: Public
             Assigned to: None
        Percent Complete: 0%
             Open/Closed: Open
                  Effort: 0.00

    _______________________________________________________

Details:

A new project has been registered at Savannah 
The project account will remain inactive until a site admin approve or
discard the registration.


######### REGISTRATION ADMINISTRATION #########

While this item will be useful to track the registration process, approving
or discarding the registration must be done using the specific "Group
Administration" page, accessible only to site administrators, effectively
logged as site administrators (superuser):

  <https://savannah.nongnu.org/siteadmin/groupedit.php?group_id=8680>


######### REGISTRATION DETAILS ######### 

Full Name:
----------
  Sort Analyser

System Group Name:
-----------------
  sort-analyser

Type:
-----
  non-GNU software & documentation

License:
-------- 
  GNU General Public License V2 or later

Description:
------------
        Sort Analyser 1.0 is mainly used for educational purposes for analysing
the time effeciency of various sorting algorithms. The data (worst,best or
avg case ) can be created dynamically on the fly and can be used for sorting.
The sorting can be either ASC or DSC. The amount of time taken for each data
set and for each sorting algorithm will be recorded by the program and the
final output will be a file which can be directly given as i/p to gnuplot.
Thus SA-1.0 can be used to analyze a particular case (worst, best and avg)
for all algos and all cases for a particular algorithm. Since all algorithms
have been implemented purely in pointers, there is virtually no limitation on
the number of entries to be sorted.

[ Deps : gnuplot make gcc ]
URL:http://www.geocities.com/sara_mit2001/projects/sort_analyser-1.0.tar.gz








    _______________________________________________________

Reply to this item at:

  <http://savannah.nongnu.org/task/?func=detailitem&item_id=5728>

_______________________________________________
  Message sent via/by Savannah
  http://savannah.nongnu.org/