# Randomized Algorithm

## on ** **

**9,159**views

This seminar was presented by Ashish Kumar...

This seminar was presented by Ashish Kumar

A randomized algorithm is defined as an algorithm that typically

uses the random bits as an auxiliary input to guide its behavior. It achievs

good performance in the "average case". Formally, the algorithm's

performance will be a random variable determined by the random bits,

with (hopefully) good expected value. The "worst case" is typically so

unlikely to occur that it can be ignored. First and foremost reason for

using randomized algorithms is simplicity.

### Statistics

### Views

- Total Views
- 9,159
- Views on SlideShare
- 9,101
- Embed Views

### Actions

- Likes
- 0
- Downloads
- 352
- Comments
- 2

### Accessibility

### Categories

### Upload Details

Uploaded via SlideShare as Adobe PDF

### Usage Rights

© All Rights Reserved

2 comments11–2 of 2 previous next

Full NameComment goes here.Lokesh Chaudhari, M.Tech in Information Technology at Walchand College of Engineering, Sangli thanks dude...tanvirbarithanks for sharing.