Browse Princeton's Series (by Date) in Princeton Economic History of the Western World

Browse Princeton‘s Series (by Date) in Princeton Economic History of the Western World

Joel Mokyr, Series Editor

Titles in the Princeton Economic History of the Western World seek to explain the full range of Western economic development in all of its facets: the transformation of medieval Europe from a rural to a capitalist economy; the institutions that marked the European revolutions, the demographic transition, and the changes they wrought on daily life; the rise of the modern capitalist economies; and the role that technology, commercial expansion, and the international division of labor played in fueling their growth throughout the West and the world.

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2007

2006

2005

2004

2003

2002

2000

1999

1996

Princeton University Press

Browse Princeton's Series (by Date) in Princeton Economic History of the Western World

原文地址：https://www.cnblogs.com/dhcn/p/11628961.html

时间： 2024-11-02 10:29:48

Browse Princeton's Series (by Date) in Princeton Economic History of the Western World的相关文章

算法（第四版）Java 第一章1.2节 题解

前言 整本<算法>Java版的题解已经托管在Github上:https://github.com/Mereder/Algorithms_4th ,大家根据README.md的导航可以迅速定位章节. 书中代码用到了很多<算法>官方提供的依赖:https://algs4.cs.princeton.edu/home/  大家可以去官网多逛逛,图书章节配合官网内容一起看效果很好. 欢迎大家站内私聊交流!小白一枚,还请前辈们多多指教! 本部分内容全部以代码形式展示,编译器为IDEA 2018

算法（Algorithms）第4版 练习 1.3.20

方法实现: //1.3.20 /** * delete the kth element in a linked list, if it exists. * * @param k the kth element, it should larger than 1 * @throws IllegalArgumentException if k < 1 * @throws NoSuchElementException if the size of the list is less than k */ p

算法（Algorithms）第4版 练习 1.5.22

package com.qiusongde; import edu.princeton.cs.algs4.StdOut; import edu.princeton.cs.algs4.StdStats; public class Exercise1522 { public static double timeTrialForQF(int T, int N, int[] edges) { Stopwatch timer = new Stopwatch(); // repeat the experim

Pandas Api 不完全翻译

原文地址 http://pandas.pydata.org/pandas-docs/stable/api.html API Reference Input/Output Pickling read_pickle(path) Load pickled pandas object (or any other pickled object) from the specified Flat File read_table(filepath_or_buffer[, sep, ...]) Read gene

算法（Algorithms）第4版 练习 2.2.11（3）

关键代码实现: public static void sort(Comparable[] input) { int N = input.length; aux = input.clone();//must be clone(the same as input) // StdOut.println("input:" + input + " aux:" + aux);//for test sort(aux, input, 0, N-1); } //take input

算法（Algorithms）第4版 练习 1.3.25 1.3.24

代码实现: //1.3.24 /** * remove the node following the node x * (and does nothing if the argument or the next field in the argument node is null) * * @param x the given node */ public static <T> void removeAfter(Node<T> x) { if(x == null || x.next

算法（Algorithms）第4版 练习 1.3.26

方法实现: //1.3.26 /** * remove all of the nodes in the list that have key as its item field * * @param list the linked list of T * @param key the T key * * @return void * */ public static <T> void remove(LinkedList<T> list, T key) { Node<T>

初级排序算法

我们关注的主要对象是重新排列数组元素的算法,其中每一个元素都有一个主键.排序算法的目标是将所有的主键按某种方式排列.排序后索引较大的元素大于等于索引较小的元素主键. 在java中,元素通常是对象,对主键的抽象描述则是通过一种内置的机制来完成的. 下面是排序算法类模版 import edu.princeton.cs.algs4.In; import edu.princeton.cs.algs4.StdOut; public class Example { //排序 public static vo

Symbol Table（符号表）

一.定义 符号表是一种存储键值对的数据结构并且支持两种操作:将新的键值对插入符号表中(insert):根据给定的键值查找对应的值(search). 二.API 1.无序符号表 几个设计决策: A.泛型 在设计方法时没有指定处理对象,而是使用了泛型. 并且将键(Key)和值(Value)区分开来. B.重复键的处理 规则: 每个值(Value)都只对应一个键(Key)(即不允许存在重复的键). 当用例代码向表中存入的键值对和表中的已有的键(以及关联的值)冲突时,新的值替代旧的值. C.Null 键