Search for tag: "elements"

Muller EM Capabilities PARADIM 2021 User meeting (MRS conference)

Zoom Recording ID: 95787656050 UUID: tYzB48zETzmUuzPJy9+Yaw== Meeting Time: 2021-12-01T23:08:10Z

From  James Overhiser 1 plays

PAMUK Theory capabilities PARADIM 2021 User meeting (MRS conference)

Zoom Recording ID: 95787656050 UUID: tYzB48zETzmUuzPJy9+Yaw== Meeting Time: 2021-12-01T23:08:10Z

From  James Overhiser 0 plays

Faeth ARPES capabilites PARADIM 2021 User meeting (MRS conference)

Zoom Recording ID: 95787656050 UUID: tYzB48zETzmUuzPJy9+Yaw== Meeting Time: 2021-12-01T23:08:10Z

From  James Overhiser 0 plays

Schlom MBE update 2021 User meeting (MRS conference)

Zoom Recording ID: 95787656050 UUID: tYzB48zETzmUuzPJy9+Yaw== Meeting Time: 2021-12-01T23:08:10Z

From  James Overhiser 1 plays

McQueen PARADIM New Enhancements 2021 User meeting (MRS conference)

Zoom Recording ID: 95787656050 UUID: tYzB48zETzmUuzPJy9+Yaw== Meeting Time: 2021-12-01T23:08:10Z

From  James Overhiser 0 plays

McQueen Bulk Crystal capabilities 2021 User meeting (MRS conference)

Zoom Recording ID: 95787656050 UUID: tYzB48zETzmUuzPJy9+Yaw== Meeting Time: 2021-12-01T23:08:10Z

From  James Overhiser 0 plays

McQueen on Big Data 2021 User meeting (MRS conference)

Zoom Recording ID: 95787656050 UUID: tYzB48zETzmUuzPJy9+Yaw== Meeting Time: 2021-12-01T23:08:10Z

From  James Overhiser 1 plays

2021 NNCI REU Convocation, Kareena Dash's Presentation

2021 NNCI REU Convocation, Kareena Dash's Presentation

From  Melanie-Claire Mallison 6 plays

MUCHIRI MBUGUA REU 2021

REU final research presentation August 16, 2021 at Cornell University.

From  James Overhiser 3 plays

Zoom Dec. 8. Coroutines

Generators may seem like a weird detour for this late in the course. But in this presentation, we show how they are used in graphics and animation.Generators are a specific example of a concept known…

From  Hannah Lee 17 plays

Lesson 30.7 Quicksort

The partition algorithm breaks up the list into two kind-of-sorted portions. In this video, we show how to use this fact with divide-and-conquer to implement a new sorting algorithm: quicksort. For…

From  Hannah Lee 16 plays

Lesson 30.5 Selection Sort

In the previous video we saw that insertion sort is not an ideal sorting algorithm. In this video we try our hand at another algorithm: selection sort. This is another simple algorithm that may be…

From  Hannah Lee 16 plays

Lesson 30.4 Sorting Performance

Through the course, we have only cared about specifications, and not performance. But as we see in this video, sorting is an application where performance really matters. Little changes to the size…

From  Hannah Lee 17 plays

Lesson 30.1 Searching

In this video, we look at the different ways we can search a list for an element. In doing so, we see that it helps a lot for our lists to be sorted. Hence that will be our focus for the rest of this…

From  Hannah Lee 18 plays

Lesson28.8 List Comprehension (OPTIONAL)

This video is not optional because the material is advanced. It is optional because this video series has run long and this topic is less important for you to know. When we are done with out…

From  Hannah Lee 13 plays

Lesson 28.6 map and filter

In this video we talk about two very famous generators: map and filter. We show how to use these to replace writing code with a for-loop.

From  Hannah Lee 36 plays