Virual Oral Presentation Slide by Slide

IEEE/ICACT20220156 Slide.36        [Big Slide]	Oral Presentation
	We compared proposed approach with conventional method in terms of complexity. We measure the complexity of an algorithm using Big-O notation. Big-O classifies an algorithm based on the execution time, inputs and number of steps required to get the output. We analyse the calculations required for each approximation of the conventional algorithm to find its complexity. Big-O in the case of conventional algorithm is (O(U3)).

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!