Skip to main content

Posts

Showing posts with the label Complexity of algorithm

Rising of the AI in the human centric Development

Rising of the AI in the human centric Development The rising of the artificial intelligence in later 90's have make a rapid impact in field of technology and from 21st century the blooming of a mechanism makes several impact in various industries including software, education, healthcare and many more. As the world becomes increasingly reliant on technology, the role of  artificial intelligence  (AI) in human-centric development has risen to the forefront. From healthcare to transportation to education, AI is being used to improve the lives of people around the globe. Major areas where artificial intelligence AI makes an Impact One area where AI has made significant strides is in the healthcare industry. AI-powered virtual assistants can now assist doctors in diagnosing and treating patients, freeing up valuable time for medical professionals. In addition, AI-powered wearable devices can track a person's health and alert them to any potential issues. The transportation industr...

How to calculate Running Time of an algorithm

                                            Calculate Running Time of an Algorithm The running time of algorithm defines the time required to execute an algorithm on the given set of inputs(n). There are mainly three types of complexity cases defines to measure the running time of an algorithm also known as Asymptotic analysis. 1) Best Case : Best case also called ( Ω) omega  notation which measure the best case scenario of how long an algorithm can possible take to complete given operation on (n) inputs. It's also known as lower bound. 2) Average Case : It represents by ( Θ) theta  notation which measure the average time requires to complete a given operation on set of inputs. It measures between upper and lower bound running time and calculate average running time. 3) Worst Case: It defines the worst case running time of an algorithm. Also represent using ( Ο) Big-o...