English subtitles

← Merrills Linear-Complexity BFS on GPUs Part1 - Intro to Parallel Programming

Get Embed Code
2 Languages

Showing Revision 5 created 05/24/2016 by Udacity Robot.

  1. And the answer is, order of n squared work.
  2. We have all n processors working
  3. and it's going to take n iterations to complete,
  4. so that's n squared work overall.