loading reading lists ...
');
function adjustReadingListIcon(isInReadingList){
$readingListToggle.toggleClass("fa-plus", !isInReadingList);
$readingListToggle.toggleClass("fa-check", isInReadingList);
var tooltipMessage = isInReadingList ? "edit in reading lists" : "add to reading list";
$readingListToggle.attr("title", tooltipMessage);
$readingListToggle.attr("data-original-title", tooltipMessage);
}
$.ajax({
url: "/readingList/isInReadingList",
data: {
productId: 959
}
}).done(function (data) {
adjustReadingListIcon(data && data.hasProductInReadingList);
}).catch(function(e){
console.log(e);
adjustReadingListIcon(false);
});
$readingListToggle.on("click", function(){
if(codePromise == null){ showToast() }
loadCode().then(function(store){
store.requestReadingListSpecificationForProduct({
id: window.readingListsServerVars.externalId,
manningId: window.readingListsServerVars.productId,
title: window.readingListsServerVars.title
});
ReadingLists.ReactDOM.render(
ReadingLists.React.createElement(ReadingLists.ManningOnlineReadingListModal, {
store: store,
}),
document.getElementById("reading-lists-modal")
);
}).catch(function(e){
console.log("Error loading code reading list code");
});
});
var codePromise
var readingListStore
function loadCode(){
if(codePromise) { return codePromise }
return codePromise = new Promise(function (resolve, reject){
$.getScript(window.readingListsServerVars.libraryLocation).done(function(){
hideToast()
readingListStore = new ReadingLists.ReadingListStore(
new ReadingLists.ReadingListProvider(
new ReadingLists.ReadingListWebProvider(
ReadingLists.SourceApp.marketplace,
getDeploymentType()
)
)
);
readingListStore.onReadingListChange(handleChange);
readingListStore.onReadingListModalChange(handleChange);
resolve(readingListStore);
}).catch(function(){
hideToast();
console.log("Error downloading reading lists source");
$readingListToggle.css("display", "none");
reject();
});
});
}
function handleChange(){
if(readingListStore != null) {
adjustReadingListIcon(readingListStore.isInAtLeastOneReadingList({
id: window.readingListsServerVars.externalId,
manningId: window.readingListsServerVars.productId
}));
}
}
var $readingListToast = $("#reading-list-toast");
function showToast(){
$readingListToast.css("display", "flex");
setTimeout(function(){
$readingListToast.addClass("shown");
}, 16);
}
function hideToast(){
$readingListToast.removeClass("shown");
setTimeout(function(){
$readingListToast.css("display", "none");
}, 150);
}
function getDeploymentType(){
switch(window.readingListsServerVars.deploymentType){
case "development":
case "test":
return ReadingLists.DeploymentType.dev;
case "qa":
return ReadingLists.DeploymentType.qa;
case "production":
return ReadingLists.DeploymentType.prod;
case "docker":
return ReadingLists.DeploymentType.docker;
default:
console.error("Unknown deployment environment, defaulting to production");
return ReadingLists.DeploymentType.prod;
}
}
});
}
});
Based on the best-selling Grokking Algorithms
pro $24.99 per month
- access to all Manning books, MEAPs, liveVideos, liveProjects, and audiobooks!
- choose one free eBook per month to keep
- exclusive 50% discount on all purchases
lite $19.99 per month
- access to all Manning books, including MEAPs!
team
5, 10 or 20 seats+ for your team - learn more
Look inside
about the subject
An algorithm is a repeatable procedure for solving a problem. The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. This engaging course makes it easy to learn and use the most important algorithms effectively.about the video
Algorithms in Motion teaches you how to apply common algorithms to the practical problems you face every day as a programmer. Following the expert guidance of liveVideo instructor Beau Carnes, you'll start with the basics, including Big O notation, fundamental data structures, and recursion. Then, you'll explore problem-solving techniques, that will empower you to see the algorithm you need in the task you're trying to accomplish. Finally, you'll finish the course by applying more advanced algorithms, such as hash tables, graph algorithms, and K-nearest.
This liveVideo course is perfect paired with Aditya Bhargava’s Grokking Algorithms, bringing the classic algorithms inside to life.
prerequisites
This easy-to-follow video course is perfect for self-taught programmers, engineers, or anyone who wants to brush up on classic algorithms.about the instructor
liveVideo instructor Beau Carnes is a software developer and a recognized authority in software instruction. Besides teaching in-person workshops and classes, he has also created around 100 software training videos that receive over 40K views per month. This includes a series on data structures and algorithms. Grokking Algorithms by Adit Bhargava is available at manning.com in pBook, eBook, and liveBook formats.Good and simple to understand introduction to algorithms.
Great way to quickly recap the most common algorithms.
Explains the fundamentals of some fairly complex computer science in a way that makes sense to anyone.
A gentle introduction to the traditional computer science topics of data structures and algorithms in a way that is not intimidating to approach.
what's a liveVideo?
- Quality lessons from expert programmers.
- Rich, interactive transcripts for navigation.
- Exercise driven learning.
what's a liveVideo?
Algorithms in Motion liveVideo for free
