search

virtual-labs-archive / data-structures-iiith

This repository contains sources to Data Structures Lab IIITH.
https://cse01-iiith.vlabs.ac.in/
Other
1 stars 73 forks source link

Sorting using Arrays_Theory #266

Open chinnusai25 opened 5 years ago

chinnusai25 commented 5 years ago

Defect description: In the section Theory, under Experiment Sorting using Arrays.It explained about "Merge Sort" and "Quick Sort" but didn't explained anything about their "Time complexities" and "Space complexities", which are an important topic to be covered ,so as to select an efficient algorithm based on the requirements given(such as total number of elements to be sorted in a given time and extra space to be used).

Steps to reproduce the issue : Data structures lab -> List of Experiments -> Sorting using Arrays -> Theory

Test step link: http://cse01-iiith.vlabs.ac.in/exp3/Theory.html?domain=Computer%20Science&lab=Data%20Structures

Expected result: The theory section should also explain about the time complexities and space complexities of the algorithms used since these are the elements used while comparing the algorithms.

Actual result: The theory section didn't explained anything about "Time and Space complexities" of the algorithms mentioned.

Screen shot: Screenshot from 2019-03-17 11-23-05

sandeep102297 commented 5 years ago

issue fixed commit id = c2f062a